Sciweavers

2343 search results - page 193 / 469
» The Locomotive Routing Problem
Sort
View
ALGOSENSORS
2009
Springer
16 years 1 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
CORR
2012
Springer
225views Education» more  CORR 2012»
14 years 2 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
PODS
2010
ACM
215views Database» more  PODS 2010»
15 years 11 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
IMC
2007
ACM
15 years 8 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
MASCOTS
2008
15 years 8 months ago
Tackling the Memory Balancing Problem for Large-Scale Network Simulation
A key obstacle to large-scale network simulation over PC clusters is the memory balancing problem where a memory-overloaded machine can slow down an entire simulation due to disk ...
Hyojeong Kim, Kihong Park