376 search results - page 31 / 76 » Solution Counting Algorithms for Constraint-Centered Search ... |
172
click to vote
PROCEDIA
2011
14 years 4 months ago
2011
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
103
click to vote
AAAI
2010
15 years 3 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
101
click to vote
PAAMS
2010
Springer
15 years 6 months ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
94
Voted
IEAAIE
2005
Springer
15 years 7 months ago
2005
Springer
The preservation of common components has been recently isolated as a beneficial feature of genetic algorithms. One interpretation of this benefit is that the preservation of commo...
168
click to vote
AI
1998
Springer
15 years 6 months ago
1998
Springer
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...