Sciweavers

2354 search results - page 224 / 471
» Randomness, Stochasticity and Approximations
Sort
View
AAAI
1997
15 years 7 months ago
Tabu Search for SAT
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Se...
Bertrand Mazure, Lakhdar Sais, Éric Gr&eacu...
IJCV
1998
163views more  IJCV 1998»
15 years 5 months ago
CONDENSATION - Conditional Density Propagation for Visual Tracking
The problem of tracking curves in dense visual clutter is challenging. Kalman filtering is inadequate because it is based on Gaussian densities which, being unimodal, cannot repre...
Michael Isard, Andrew Blake
TMC
2010
139views more  TMC 2010»
15 years 4 months ago
Optimize Storage Placement in Sensor Networks
—Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introdu...
Bo Sheng, Qun Li, Weizhen Mao
SLS
2009
Springer
243views Algorithms» more  SLS 2009»
16 years 12 days ago
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
Andrew M. Sutton, Adele E. Howe, L. Darrell Whitle...
GECCO
2007
Springer
164views Optimization» more  GECCO 2007»
16 years 1 days ago
A study of mutational robustness as the product of evolutionary computation
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
Justin Schonfeld