206 search results - page 25 / 42 » Random backtracking in backtrack search algorithms for satis... |
AI
2001
Springer
14 years 29 days ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
ECAI
2000
Springer
14 years 24 days ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
WSC
2008
13 years 10 months ago
2008
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
DASFAA
2008
IEEE
13 years 10 months ago
2008
IEEE
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
IJCAI
2001
13 years 9 months ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...