15033 search results - page 2869 / 3007 » Complexity Theory and Algorithms |
157
click to vote
CCCG
2008
15 years 5 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...
169
click to vote
DAGSTUHL
2007
15 years 5 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...
148
click to vote
EON
2008
15 years 5 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 (...
211
click to vote
NIPS
2008
15 years 5 months ago
2008
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
128
click to vote
AAAI
2004
15 years 5 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...