2095 search results - page 163 / 419 » Improved pebbling bounds |
168
click to vote
CSCLP
2004
Springer
15 years 10 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...
169
click to vote
CADE
2006
Springer
15 years 10 months ago
2006
Springer
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
208
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
213
click to vote
ISAAC
2000
Springer
15 years 10 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
162
click to vote
ASPDAC
1995
ACM
15 years 10 months ago
1995
ACM
In this article a scheduling method is presented which is capable of allocating supplementary resources during scheduling. This makes it very suitable in synthesis strategies base...