Sciweavers

3958 search results - page 382 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 4 months ago
Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks
We consider deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends ...
Jerome Le Ny, George J. Pappas
ICNSC
2008
IEEE
16 years 1 months ago
Cscan: A Correlation-based Scheduling Algorithm for Wireless Sensor Networks
— Dynamic scheduling management in wireless sensor networks is one of the most challenging problems in long lifetime monitoring applications. In this paper, we propose and evalua...
Qingquan Zhang, Yu Gu, Tian He, Gerald E. Sobelman
SPAA
1994
ACM
15 years 11 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
WAC
2005
Springer
118views Communications» more  WAC 2005»
16 years 7 days ago
Towards a Reliable, Wide-Area Infrastructure for Context-Based Self-management of Communications
Abstract. In this paper we describe ConStruct, a distributed, contextaggregation based service infrastructure which supports the development of context-aware applications. ConStruc...
Graeme Stevenson, Paddy Nixon, Simon A. Dobson
ICCD
2007
IEEE
150views Hardware» more  ICCD 2007»
15 years 10 months ago
CAP: Criticality analysis for power-efficient speculative multithreading
While Speculative Multithreading (SM) on a Chip Multiprocessor (CMP) has the ability to speed-up hard-toparallelize applications, the power inefficiency of aggressive speculation ...
James Tuck, Wei Liu, Josep Torrellas