5580 search results - page 48 / 1116 » Randomized priority algorithms |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
DAM
2006
14 years 9 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
76
Voted
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...
PIMRC
2008
IEEE
15 years 4 months ago
2008
IEEE
—We consider the Bayesian inference of a random Gaussian vector in a linear model with a random Gaussian matrix. We review two approaches to finding the MAP estimator for this m...
ICCV
2007
IEEE
15 years 11 months ago
2007
IEEE
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...