4451 search results - page 110 / 891 » On Random Ordering Constraints |
164
click to vote
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
140
click to vote
FSEN
2007
Springer
15 years 8 months ago
2007
Springer
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any spe...
129
click to vote
PLDI
1995
ACM
15 years 8 months ago
1995
ACM
d Abstract) Alexander Aiken Manuel F¨ahndrich Raph Levieny Computer Science Division University of California, Berkeleyz Static memory managementreplaces runtime garbage collecti...
140
click to vote
MMAS
2010
Springer
14 years 11 months ago
2010
Springer
We present a formal procedure for structure-preserving model reduction of linear second-order and Hamiltonian control problems that appear in a variety of physical contexts, e.g., ...
170
click to vote
TEC
2002
15 years 4 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...