Sciweavers

597 search results - page 22 / 120
» Homomorphisms of random paths
Sort
View
TCOS
2010
14 years 8 months ago
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...
102
Voted
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
15 years 1 months ago
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
James J. Kuffner Jr., Steven M. LaValle
ICOIN
2012
Springer
13 years 5 months ago
Coordinated TCP Westwood congestion control for multiple paths over wireless networks
— Multipath TCP (MPTCP) has just been approved by the IETF. It was designed to be fairly shared with regular TCP, so its performance is equivalent that of a regular TCP flow tha...
Tuan Anh Le, Choong Seon Hong, Eui-nam Huh
COMBINATORICA
2011
13 years 9 months ago
Binary subtrees with few labeled paths
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
Rodney G. Downey, Noam Greenberg, Carl G. Jockusch...
70
Voted
COR
2007
103views more  COR 2007»
14 years 9 months ago
A reactive GRASP and path relinking for a combined production-distribution problem
An NP-hard production–distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize total cost taking production setups, inventory lev...
Mourad Boudia, Mohamed Aly Ould Louly, Christian P...