16404 search results - page 714 / 3281 » A set coverage problem |
190
Voted
CP
2006
Springer
15 years 11 months ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
213
click to vote
CAV
2008
Springer
15 years 9 months ago
2008
Springer
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...
202
click to vote
CCCG
2010
15 years 8 months ago
2010
The Polar Diagram [1] of a set of points (i.e. sites) is a partition of the plane. It is a locus approach for problems processing angles. Also, Dynamic Polar Diagram problem is a ...
175
click to vote
AIPS
2004
15 years 8 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
202
click to vote
ECAI
2010
Springer
15 years 8 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...