Sciweavers

7930 search results - page 78 / 1586
» Greedy in Approximation Algorithms
Sort
View
PERCOM
2009
ACM
16 years 29 days ago
Look-ahead Geographic Routing for Sensor Networks
— As sensor networks are deployed over various terrains, the complexity of their topology continues to grow. Voids in networks often cause existing geographic routing algorithms ...
Jiaxi You, Dominik Lieckfeldt, Qi Han, Jakob Salzm...
ICPP
2002
IEEE
15 years 11 months ago
Power Aware Scheduling for AND/OR Graphs in Multi-Processor Real-Time Systems
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
Dakai Zhu, Nevine AbouGhazaleh, Daniel Mossé...
EDBT
2006
ACM
136views Database» more  EDBT 2006»
16 years 6 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen
ATAL
2010
Springer
15 years 7 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
IPL
2008
61views more  IPL 2008»
15 years 6 months ago
Online chasing problems for regular polygons
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside th...
Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa