5316 search results - page 25 / 1064 » Which Search Problems Are Random |
125
Voted
CP
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satis...
ICTAI
1999
IEEE
15 years 5 months ago
1999
IEEE
Recently there has been significant progress in our understanding of the computational nature of combinatorial problems. Randomized search methods, both complete and incomplete, o...
82
Voted
SLS
2007
Springer
15 years 6 months ago
2007
Springer
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
123
Voted
CONSTRAINTS
2010
15 years 23 days ago
2010
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
ANOR
2007
15 years 24 days ago
2007
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...