2178 search results - page 408 / 436 » Inferring complex plans |
IJCAI
1993
13 years 9 months ago
1993
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
HPDC
2010
IEEE
13 years 8 months ago
2010
IEEE
Grid computing has been widely adopted for intensive high performance computing. Since grid resources are distributed over complex large-scale infrastructures, understanding grid ...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
HAPTICS
2008
IEEE
13 years 8 months ago
2008
IEEE
The well known property of haptic interaction is the high refresh rate of the haptic loop that is necessary for the stability of the interaction. Therefore, only simple computation...
SMA
2010
ACM
13 years 7 months ago
2010
ACM
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...