230 search results - page 11 / 46 » Quantum Search with Variable Times |
JFPLC
2001
14 years 8 days ago
2001
We propose an environment for musical constraint solving, in the visual programming language OpenMusic. We describe an implementation of a local search algorithm, called adaptive s...
VMCAI
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample min...
COCOA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
AMAI
2002
Springer
13 years 10 months ago
2002
Springer
The technique of watching two literals per clause to determine when a clause becomes a unit clause was introduced recently in the Chaff satisfiability program. That program does n...
IJCAI
2003
14 years 7 days ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...