3875 search results - page 677 / 775 » Approximation algorithms for the 0-extension problem |
IJRR
2007
14 years 9 months ago
2007
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
RECOMB
2004
Springer
15 years 10 months ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
100
click to vote
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
NIPS
2007
14 years 11 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...