Sciweavers

870 search results - page 95 / 174
» Theoretical and experimental results on the goal-plan tree p...
Sort
View
WELCOM
2001
Springer
132views ECommerce» more  WELCOM 2001»
15 years 2 months ago
Incentives for Sharing in Peer-to-Peer Networks
The recent and unprecedented surge of public interest in peer-to-peer file sharing has led to a variety of interesting research questions. In this paper, we will address the ince...
Philippe Golle, Kevin Leyton-Brown, Ilya Mironov, ...
ICRA
2007
IEEE
143views Robotics» more  ICRA 2007»
15 years 4 months ago
Anytime, Dynamic Planning in High-dimensional Search Spaces
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
Dave Ferguson, Anthony Stentz
ML
2010
ACM
193views Machine Learning» more  ML 2010»
14 years 4 months ago
On the eigenvectors of p-Laplacian
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
Dijun Luo, Heng Huang, Chris H. Q. Ding, Feiping N...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 4 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
FSTTCS
2009
Springer
15 years 4 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi