272 search results - page 42 / 55 » A Game-Theoretic Approach to Constraint Satisfaction |
IROS
2007
IEEE
15 years 7 months ago
2007
IEEE
— This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelo...
109
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
120
click to vote
ECAI
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
138
click to vote
CSMR
1998
IEEE
15 years 5 months ago
1998
IEEE
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
108
click to vote
AIPS
1994
15 years 2 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...