3098 search results - page 350 / 620 » On distributed smooth scheduling |
181
click to vote
CN
2010
15 years 6 months ago
2010
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
197
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
202
click to vote
CODES
2011
IEEE
14 years 6 months ago
2011
IEEE
Reliability is a major requirement for most safety-related systems. To meet this requirement, fault-tolerant techniques such as hardware replication and software re-execution are ...
260
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
Distributed databases and other networked information systems use copies or mirrors to reduce latency and to increase availability. Copies need to be refreshed. In a loosely coupl...
176
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Many reconfigurable architectures offer partial dynamic configurability, but current system-level tools cannot guarantee feasible implementations when exploiting this feature. We ...