2976 search results - page 338 / 596 » On the bounded integer programming |
126
click to vote
ICSE
2007
IEEE-ACM
16 years 4 months ago
2007
IEEE-ACM
This paper describes the Korat tool for constraint-based generation of structurally complex test inputs for Java programs. Korat takes (1) an imperative predicate that specifies t...
139
click to vote
ICFP
2004
ACM
16 years 4 months ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
129
click to vote
POPL
2000
ACM
15 years 9 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
138
click to vote
CSCLP
2004
Springer
15 years 8 months ago
2004
Springer
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our propo...
140
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...