Sciweavers

661 search results - page 73 / 133
» Local Approximation Algorithms for Scheduling Problems in Se...
Sort
View
JSAC
2006
107views more  JSAC 2006»
13 years 8 months ago
Adaptive Sensor Activity Control in Many-to-One Sensor Networks
Abstract--In this paper, we consider a many-to-one sensor network where a large number of sensors are deployed to monitor a physical environment. We explore sensor activity managem...
Zhifeng Hu, Junshan Zhang, Lang Tong
IPPS
2009
IEEE
14 years 3 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
FSR
2003
Springer
251views Robotics» more  FSR 2003»
14 years 1 months ago
Distributed Search and Rescue with Robot and Sensor Teams
We develop a network of distributed mobile sensor systems as a solution to the emergency response problem. The mobile sensors are inside a building and they form a connected ad-ho...
George Kantor, Sanjiv Singh, Ronald A. Peterson, D...
EMSOFT
2005
Springer
14 years 2 months ago
A GA-based scheduling method for FlexRay systems
An advanced communication system, the FlexRay system, has been developed for future automotive applications. It consists of time-triggered clusters, such as drive-by-wire in cars,...
Shan Ding, Naohiko Murakami, Hiroyuki Tomiyama, Hi...
EWSN
2009
Springer
14 years 9 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...