10608 search results - page 1965 / 2122 » Complexity of O'Hara's Algorithm |
108
Voted
CLIMA
2007
15 years 2 months ago
2007
Abstract. Task-based planning problems for multi-agent systems require multiple agents to find a joint plan for a constrained set of tasks. Typically, each agent receives a subset...
114
Voted
CCCG
2008
15 years 2 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
129
Voted
DAGSTUHL
2007
15 years 2 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
124
click to vote
EUSFLAT
2007
15 years 2 months ago
2007
At present time configurable wireless sensor networks are given special consideration. Wireless sensor networks are now a static elements union. To make such a network a powerful ...
108
Voted
EON
2008
15 years 2 months ago
2008
Abstract. In this paper we show how to apply a tableau-based software composition technique to automatically generate the mediator's service logic. This uses an LTL planning (...