79 search results - page 9 / 16 » Strategies for Solving SAT in Grids by Randomized Search |
PRICAI
2004
Springer
15 years 2 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
TIME
2002
IEEE
15 years 2 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
SAT
2004
Springer
15 years 2 months ago
2004
Springer
2QBF is the problem of evaluating a Quantified Boolean Formula (QBF) with two levels of quantification. Many practical problems in sequential verification can be formulated as i...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...
WAIM
2007
Springer
15 years 3 months ago
2007
Springer
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...