3946 search results - page 489 / 790 » The computational complexity of choice sets |
144
click to vote
SG
2005
Springer
16 years 7 days ago
2005
Springer
We present a system using semi-autonomous agents to help artists express ideas. Agents control their representation on a canvas via interactions in agent space. They are given a se...
178
click to vote
CSCLP
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
147
click to vote
CPAIOR
2004
Springer
16 years 5 days ago
2004
Springer
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
203
click to vote
EUROPAR
2004
Springer
16 years 4 days ago
2004
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
145
click to vote
ISAAC
2004
Springer
16 years 4 days ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...