Sciweavers

1646 search results - page 267 / 330
» A genetic algorithm for designing distributed computer netwo...
Sort
View
125
Voted
SENSYS
2005
ACM
15 years 9 months ago
Sympathy for the sensor network debugger
Being embedded in the physical world, sensor networks present a wide range of bugs and misbehavior qualitatively different from those in most distributed systems. Unfortunately, d...
Nithya Ramanathan, Kevin K. Chang, Rahul Kapur, Le...
159
Voted
HIPC
2007
Springer
15 years 7 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
137
Voted
DCOSS
2005
Springer
15 years 9 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
155
Voted
PPSN
2000
Springer
15 years 7 months ago
Optimizing through Co-evolutionary Avalanches
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...
212
Voted
MOBIHOC
2002
ACM
16 years 3 months ago
Minimum energy paths for reliable communication in multi-hop wireless networks
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...
Suman Banerjee, Archan Misra