3875 search results - page 432 / 775 » Approximation algorithms for the 0-extension problem |
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...
187
click to vote
WEA
2007
Springer
16 years 26 days ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
160
click to vote
AAAI
2007
15 years 9 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
188
click to vote
ICML
1998
IEEE
16 years 7 months ago
1998
IEEE
Production scheduling, the problem of sequentially con guring a factory to meet forecasted demands, is a critical problem throughout the manufacturing industry. The requirement of...
181
click to vote
TPDS
2008
15 years 6 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...