5624 search results - page 35 / 1125 » On Conditional Covering Problem |
120
click to vote
DAGSTUHL
2007
15 years 3 months ago
2007
Abstract. The sentences of deontic logic may be understood as describing what an agent ought to do when faced with a given set of norms. If these norms come into conflict, the bes...
ANOR
2002
15 years 2 months ago
2002
Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept...
103
click to vote
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
The lexicographically-ordered CSP ("lexicographic CSP" for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Prefe...
122
click to vote
AIPS
2011
14 years 6 months ago
2011
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
122
click to vote
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...