Sciweavers

1257 search results - page 244 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
DMSN
2007
ACM
15 years 1 months ago
SenseSwarm: a perimeter-based data acquisition framework for mobile sensor networks
This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm1 . Our objectives are to explore a given geographic region by detecting and aggregating sp...
Demetrios Zeinalipour-Yazti, Panayiotis Andreou, P...
CASES
2005
ACM
14 years 11 months ago
Exploiting pipelining to relax register-file port constraints of instruction-set extensions
Customisable embedded processors are becoming available on the market, thus making it possible for designers to speed up execution of applications by using Application-specific F...
Laura Pozzi, Paolo Ienne
ICCAD
2009
IEEE
135views Hardware» more  ICCAD 2009»
14 years 7 months ago
Enhanced reliability-aware power management through shared recovery technique
While Dynamic Voltage Scaling (DVS) remains as a popular energy management technique for real-time embedded applications, recent research has identified significant and negative i...
Baoxian Zhao, Hakan Aydin, Dakai Zhu
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 7 months ago
Balanced Interval Coloring
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two co...
Antonios Antoniadis, Falk Hüffner, Pascal Len...
CORR
2010
Springer
160views Education» more  CORR 2010»
14 years 6 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely