5624 search results - page 81 / 1125 » On Conditional Covering Problem |
150
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We describe a method for synthesizing reasonable underapproximations to weakest preconditions for termination--a long-standing open problem. The paper provides experiment...
133
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
The optimization of the epoxy polymerization process involves a number of conflicting objectives and more than twenty decision parameters. In this paper, the problem is treated tr...
145
click to vote
MOR
2002
15 years 5 months ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
176
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
150
click to vote
SIROCCO
2001
15 years 7 months ago
2001
The condition-based approach for consensus solvability (that we have introduced in a previous paper, ACM STOC'01) consists in identifying sets of input vectors for which it i...