Sciweavers

710 search results - page 27 / 142
» On Minimum Power Connectivity Problems
Sort
View
JCO
2011
113views more  JCO 2011»
13 years 2 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
ESA
2007
Springer
93views Algorithms» more  ESA 2007»
14 years 1 months ago
Polynomial Time Algorithms for Minimum Energy Scheduling
The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for savin...
Philippe Baptiste, Marek Chrobak, Christoph Dü...
INFOCOM
2005
IEEE
14 years 1 months ago
A calculus approach to minimum energy transmission policies with quality of service guarantees
— We consider a queueing system with controllable service rate; for example, a transmitter whose rate can be controlled by varying the transmission power. For such a system we ob...
Murtaza Zafer, Eytan Modiano
ICRA
2010
IEEE
172views Robotics» more  ICRA 2010»
13 years 6 months ago
Coordinated multi-robot real-time exploration with connectivity and bandwidth awareness
— While there has been substantial progress for multi-robot exploration of an unknown area, little attention has been given to communication, especially bandwidth constraints in ...
Yuanteng Pei, Matt W. Mutka, Ning Xi
TCOM
2008
81views more  TCOM 2008»
13 years 7 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...