Sciweavers

2796 search results - page 500 / 560
» The coolest path problem
Sort
View
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
15 years 7 months ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
JAL
2006
101views more  JAL 2006»
15 years 1 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
ATAL
2006
Springer
15 years 5 months ago
Continuous refinement of agent resource estimates
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
David N. Morley, Karen L. Myers, Neil Yorke-Smith
ALGOSENSORS
2008
Springer
15 years 4 months ago
Simple Robots in Polygonal Environments: A Hierarchy
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
Jan Brunner, Matús Mihalák, Subhash ...
CCCG
2008
15 years 3 months ago
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...