1033 search results - page 31 / 207 » The Relative History Heuristic |
CP
1995
Springer
15 years 3 months ago
1995
Springer
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...
148
click to vote
CP
2004
Springer
15 years 5 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
GROUP
2009
ACM
15 years 6 months ago
2009
ACM
Networked multiplayer games must support a much wider variety of interactions than single-player games because networked games involve communication and coordination between playe...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
129
click to vote
ICDCS
2000
IEEE
15 years 4 months ago
2000
IEEE
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...