52 search results - page 5 / 11 » Phase Transitions in Classical Planning: An Experimental Stu... |
AIPS
2000
14 years 10 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
109
click to vote
CP
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
CHI
2011
ACM
14 years 1 months ago
2011
ACM
In this paper we describe our findings from a field study that was conducted at the Vancouver Aquarium to investigate how visitors interact with a large interactive table exhibi...
STAIRS
2008
14 years 11 months ago
2008
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...