Sciweavers

1040 search results - page 175 / 208
» Rounding algorithms for covering problems
Sort
View
SPAA
2010
ACM
14 years 9 months ago
Scheduling to minimize power consumption using submodular functions
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
Erik D. Demaine, Morteza Zadimoghaddam
65
Voted
WWW
2004
ACM
15 years 10 months ago
Type based service composition
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
78
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
Robust Location Detection in Emergency Sensor Networks
— We propose a new framework for providing robust location detection in emergency response systems, based on the theory of identifying codes. The key idea of this approach is to ...
Saikat Ray, Rachanee Ungrangsi, Francesco De Pelle...
SRDS
2010
IEEE
14 years 7 months ago
Shedding Light on Enterprise Network Failures Using Spotlight
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
Dipu John, Pawan Prakash, Ramana Rao Kompella, Ran...
ICRA
2007
IEEE
154views Robotics» more  ICRA 2007»
15 years 4 months ago
Path Planning for Planetary Exploration Rovers and Its Evaluation based on Wheel Slip Dynamics
— In this paper, a path planning and its evaluation method is described with taking into account wheel slip dynamics of lunar/planetary exploration rovers. The surface of the pla...
Genya Ishigami, Keiji Nagatani, Kazuya Yoshida