151
click to vote
CP
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 ...
115
click to vote
CP
15 years 5 months ago
2004 Springer
The contribution of this paper is in demonstrating the impact of AND/OR search spaces view on solutions counting. In contrast to the traditional (OR) search space view, the AND/OR ...
110
click to vote
CP
15 years 5 months ago
2004 Springer
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
107
click to vote
CP
15 years 3 months ago
2004 Springer
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
104
click to vote
CP
15 years 3 months ago
2004 Springer
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
|