6105 search results - page 850 / 1221 » A Parallel Algorithm for Bound-Smoothing |
187
Voted
DCOSS
2008
Springer
15 years 8 months ago
2008
Springer
Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more...
191
click to vote
DEBS
2008
ACM
15 years 8 months ago
2008
ACM
Automatic service composition is an active research area in the field of service computing. This paper presents a distributed approach to automatically discover a composition of s...
214
click to vote
FPL
2008
Springer
15 years 8 months ago
2008
Springer
Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...
211
click to vote
CCGRID
2009
IEEE
15 years 7 months ago
2009
IEEE
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
193
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
Ants provide an attractive metaphor for robots that "cooperate" in performing complex tasks. What, however, are the algorithmic consequences of following this metaphor? ...