Search Process and Probabilistic Bifix Approach

08/23/2005
by   Dragana Bajic, et al.
0

An analytical approach to a search process is a mathematical prerequisite for digital synchronization acquisition analysis and optimization. A search is performed for an arbitrary set of sequences within random but not equiprobable L-ary data. This paper derives in detail an expression for probability distribution function, from which other statistical parameters - expected value and variance - can be obtained. The probabilistic nature of (cross-) bifix indicators is shown and application examples are outlined, ranging beyond the usual telecommunication field.

READ FULL TEXT
research
11/24/2022

Theoretical Study of Optimizing Rugged Landscapes with the cGA

Estimation of distribution algorithms (EDAs) provide a distribution - ba...
research
07/20/2021

What Do You Get When You Cross Beam Search with Nucleus Sampling?

We combine beam search with the probabilistic pruning technique of nucle...
research
11/27/2018

Probabilistic properties of detrended fluctuation analysis for Gaussian processes

The detrended fluctuation analysis (DFA) is one of the most widely used ...
research
06/23/2019

A Uniform Approach to Random Process Model

There is a lot of research on probabilistic transition systems. There ar...
research
02/05/2020

Fracture in random quasibrittle media: I. Discrete mesoscale simulations of load capacity and fracture process zone

Numerical simulations of concrete fracture performed with a probabilisti...
research
04/24/2020

Variance Reduction for Better Sampling in Continuous Domains

Design of experiments, random search, initialization of population-based...
research
09/09/2015

A Topological Approach to Meta-heuristics: Analytical Results on the BFS vs. DFS Algorithm Selection Problem

Search is a central problem in artificial intelligence, and BFS and DFS ...

Please sign up or login with your details

Forgot password? Click here to reset