3946 search results - page 491 / 790 » The computational complexity of choice sets |
197
Voted
AISC
2010
Springer
15 years 11 months ago
2010
Springer
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...
209
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Ontologies can be used to provide an enriched vocabulary for the formulation of queries over instance data. We identify query emptiness and predicate emptiness as two central reas...
184
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Interested in Evolutionary Robotics, this paper focuses on the acquisition and exploitation of memory skills. The targeted task is a well-studied benchmark problem, the Tolman ...
166
click to vote
PODS
1999
ACM
15 years 11 months ago
1999
ACM
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
192
click to vote
CP
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...