Sciweavers

783 search results - page 51 / 157
» Improved approximation algorithms for the freeze-tag problem
Sort
View
ICC
2007
IEEE
113views Communications» more  ICC 2007»
14 years 3 months ago
Load-Balanced Clustering Algorithms for Wireless Sensor Networks
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
Chor Ping Low, Can Fang, Jim Mee Ng, Yew Hock Ang
PODS
2012
ACM
276views Database» more  PODS 2012»
11 years 11 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 5 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
APPROX
2008
Springer
124views Algorithms» more  APPROX 2008»
13 years 10 months ago
Deterministic 7/8-Approximation for the Metric Maximum TSP
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
Lukasz Kowalik, Marcin Mucha
FOGA
2011
13 years 5 days ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe