Sciweavers

1382 search results - page 168 / 277
» Formal Analysis of Online Algorithms
Sort
View
SPAA
2003
ACM
15 years 11 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
15 years 10 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
WWW
2007
ACM
16 years 7 months ago
A clustering method for web data with multi-type interrelated components
Traditional clustering algorithms work on "flat" data, making the assumption that the data instances can only be represented by a set of homogeneous and uniform features...
Levent Bolelli, Seyda Ertekin, Ding Zhou, C. Lee G...
JSSPP
2007
Springer
16 years 18 days ago
A Self-optimized Job Scheduler for Heterogeneous Server Clusters
Heterogeneous clusters and grid infrastructures are becoming increasingly popular. In these computing infrastructures, machines have different resources, including memory sizes, d...
Elad Yom-Tov, Yariv Aridor
MICRO
2002
IEEE
108views Hardware» more  MICRO 2002»
15 years 11 months ago
Dynamic frequency and voltage control for a multiple clock domain microarchitecture
We describe the design, analysis, and performance of an on–line algorithm to dynamically control the frequency/voltage of a Multiple Clock Domain (MCD) microarchitecture. The MC...
Greg Semeraro, David H. Albonesi, Steve Dropsho, G...