348 search results - page 22 / 70 » Search Ordering Heuristics for Restarts-Based Constraint Sol... |
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
MTV
2003
IEEE
14 years 2 months ago
2003
IEEE
Bounded Model Checking (BMC) techniques have been used for formal hardware verification, with the help of tools such as GRASP (Generic search Algorithm for Satisfiability Proble...
ACISICIS
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
PPSN
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
ECAI
2006
Springer
14 years 14 days ago
2006
Springer
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...