16404 search results - page 177 / 3281 » A set coverage problem |
125
Voted
AAAI
2008
15 years 5 months ago
2008
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...
134
Voted
JAIR
2010
15 years 1 months ago
2010
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
122
Voted
SLOGICA
2010
15 years 1 months ago
2010
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
133
Voted
DAGM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of non-rigid, point-to-point registration of two 3D surfaces. To avoid restrictions on the topology, we represent the surfaces as a level-set of t...
105
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--This paper presents an approach to the task of locating a group of buildings based solely on their relative spatial relationships. This situation can occur in the problem...