Sciweavers

1541 search results - page 71 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
13 years 10 months ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
JAIR
2002
182views more  JAIR 2002»
13 years 9 months ago
An Analysis of Phase Transition in NK Landscapes
In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the unif...
Yong Gao, Joseph C. Culberson
DAS
2010
Springer
13 years 11 months ago
Overlapped text segmentation using Markov random field and aggregation
Separating machine printed text and handwriting from overlapping text is a challenging problem in the document analysis field and no reliable algorithms have been developed thus f...
Xujun Peng, Srirangaraj Setlur, Venu Govindaraju, ...
TIT
2010
143views Education» more  TIT 2010»
13 years 4 months ago
Asynchronous CDMA systems with random spreading-part I: fundamental limits
Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit. We allow for arbitrary chip waveforms and ...
Laura Cottatellucci, Ralf R. Müller, Mé...
CORR
2006
Springer
125views Education» more  CORR 2006»
13 years 9 months ago
Barriers and local minima in energy landscapes of stochastic local search
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
Petteri Kaski