110 search results - page 2 / 22 » Automatic Generator of Minimal Problem Solvers |
103
Voted
ISCIS
2009
Springer
15 years 7 months ago
2009
Springer
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
103
Voted
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
135
Voted
CSCLP
2004
Springer
15 years 6 months ago
2004
Springer
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
132
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
111
click to vote
IJCAI
1997
15 years 2 months ago
1997
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...