2109 search results - page 344 / 422 » Solving Necklace Constraint Problems |
151
click to vote
SSD
2005
Springer
15 years 9 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
152
click to vote
ATAL
2003
Springer
15 years 9 months ago
2003
Springer
Interacting agents that interleave planning and execution must reach consensus on their commitments to each other. In domains where agents have varying degrees of interaction and ...
159
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
—In this paper, we introduce a cross-layer design framework to the multiple access problem in contention-based wireless ad hoc networks. The motivation for this study is twofold,...
125
click to vote
EPIA
2001
Springer
15 years 8 months ago
2001
Springer
Dealing with temporality on actions presents an important challenge to AI planning. Unlike Graphplan-based planners which alternate levels of propositions and actions in a regular ...
151
click to vote
ICLP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...