298 search results - page 53 / 60 » Minimizing Flow Time in the Wireless Gathering Problem |
PARELEC
2002
IEEE
13 years 11 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
VTS
2000
IEEE
13 years 11 months ago
2000
IEEE
Excessive switching activity during scan testing can cause average power dissipation and peak power during test to be much higher than during normal operation. This can cause prob...
PODC
2009
ACM
14 years 7 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
ICCCN
2008
IEEE
14 years 1 months ago
2008
IEEE
—Broadcast presents a special challenge for Wireless Sensor Networks (WSNs). In some situation such as time synchronization or building routing path, broadcasting messages must b...
EMSOFT
2009
Springer
13 years 10 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...