12659 search results - page 259 / 2532 » The distributed breakout algorithms |
185
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
For the past few years researches have been investigating enhancing tracking performance by combining several different tracking algorithms. We propose an analytically justified, ...
175
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
145
click to vote
EUROPAR
2006
Springer
15 years 10 months ago
2006
Springer
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
191
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
158
click to vote
DKE
2007
15 years 6 months ago
2007
The use of rules in a distributed environment creates new challenges for the development of active rule execution models. In particular, since a single event can trigger multiple ...