Sciweavers

5595 search results - page 965 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
IJRR
2007
104views more  IJRR 2007»
15 years 6 months ago
Deep Space Formation Flying Spacecraft Path Planning
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...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
SIGECOM
2011
ACM
219views ECommerce» more  SIGECOM 2011»
14 years 9 months ago
GSP auctions with correlated types
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
Brendan Lucier, Renato Paes Leme
RECOMB
2004
Springer
16 years 6 months ago
The evolutionary capacity of protein structures
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...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
16 years 29 days ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— 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...
Bin Yao, Feifei Li, Piyush Kumar
ATAL
2007
Springer
16 years 8 days ago
Commitment-driven distributed joint policy search
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...
Stefan J. Witwicki, Edmund H. Durfee