Sciweavers

641 search results - page 89 / 129
» On robust online scheduling algorithms
Sort
View
ICRA
2007
IEEE
125views Robotics» more  ICRA 2007»
14 years 2 months ago
Single-Query Motion Planning with Utility-Guided Random Trees
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...
Brendan Burns, Oliver Brock
AAAI
2000
13 years 9 months ago
Coordination for Multi-Robot Exploration and Mapping
This paper addresses the problem of exploration and mapping of an unknown environment by multiple robots. The mapping algorithm is an on-line approach to likelihood maximization t...
Reid G. Simmons, David Apfelbaum, Wolfram Burgard,...
CORR
2011
Springer
144views Education» more  CORR 2011»
12 years 11 months ago
Rank Aggregation via Nuclear Norm Minimization
The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion...
David F. Gleich, Lek-Heng Lim
CDC
2008
IEEE
187views Control Systems» more  CDC 2008»
14 years 2 months ago
Controlled random access MAC for network utility maximization in wireless networks
— There has been much recent interest in protocol design for wireless networks based on maximizing a network utility function. A significant advance in recent years is the obser...
Robert J. McCabe, Nikolaos M. Freris, P. R. Kumar
SP
2009
IEEE
144views Security Privacy» more  SP 2009»
14 years 2 months ago
De-anonymizing Social Networks
Operators of online social networks are increasingly sharing potentially sensitive information about users and their relationships with advertisers, application developers, and da...
Arvind Narayanan, Vitaly Shmatikov