168 search results - page 29 / 34 » New upper bounds on the decomposability of planar graphs |
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
– In this paper, we proposed an improved algorithm for the multi-robot complete coverage problem. Real world applications such as lawn mowing, chemical spill clean-up, and humani...
ICDCS
2008
IEEE
14 years 1 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
IROS
2008
IEEE
14 years 1 months ago
2008
IEEE
— Cabled robotic systems have been used for a diverse set of applications such as environmental sensing, search and rescue, sports and entertainment and air vehicle simulators. I...
DATE
2008
IEEE
14 years 1 months ago
2008
IEEE
Power gating is one of the most effective techniques in reducing the standby leakage current of VLSI circuits. In this paper we introduce a new approach for sleep transistor sizin...
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...