246 search results - page 22 / 50 » Bichain graphs: Geometric model and universal graphs |
CPAIOR
2004
Springer
15 years 3 months ago
2004
Springer
ng Abstractions for Local Search Pascal Van Hentenryck1 and Laurent Michel2 1 Brown University, Box 1910, Providence, RI 02912 2 University of Connecticut, Storrs, CT 06269-3155 Ab...
MOBICOM
2005
ACM
15 years 3 months ago
2005
ACM
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
SODA
2007
ACM
14 years 11 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
— This work recommends an architecture and its fundamental components for motion planning for mobile robots in dynamic environments. An adaptive behavior to typical motion patter...