Sciweavers

242
Voted
CP
2004
Springer
16 years 4 days ago
Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory
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 ...
Vincent A. Cicirello, Stephen F. Smith
CP
2004
Springer
16 years 4 days ago
The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting
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 ...
Rina Dechter, Robert Mateescu
CP
2004
Springer
16 years 4 days ago
Generating Robust Partial Order Schedules
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. ...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A...
CP
2004
Springer
16 years 4 days ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate
Artificial Intelligence
Top of PageReset Settings