Sciweavers

6095 search results - page 202 / 1219
» Learning in Local Search
Sort
View
105
Voted
AUSAI
2004
Springer
15 years 8 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
117
Voted
CEC
2003
IEEE
15 years 8 months ago
Where are bottlenecks in NK fitness landscapes?
Abstract- Usually the offspring-parent fitness correlation is used to visualize and analyze some caracteristics of fitness landscapes such as evolvability. In this paper, we intr...
Sébastien Vérel, Philippe Collard, M...
116
Voted
AAAI
2006
15 years 4 months ago
Domain-Independent Structured Duplicate Detection
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
Rong Zhou, Eric A. Hansen
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
15 years 2 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...
162
Voted
MOBISYS
2010
ACM
15 years 5 months ago
CrowdSearch: exploiting crowds for accurate real-time image search on mobile phones
Mobile phones are becoming increasingly sophisticated with a rich set of on-board sensors and ubiquitous wireless connectivity. However, the ability to fully exploit the sensing c...
Tingxin Yan, Vikas Kumar, Deepak Ganesan