Sciweavers

392 search results - page 15 / 79
» Modular Competitiveness for Distributed Algorithms
Sort
View
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 4 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
SAC
2011
ACM
12 years 10 months ago
I4Copter: an adaptable and modular quadrotor platform
Quadrotor helicopters are micro air vehicles with vertical take-off and landing capabilities controlled by varying the rotation speed of four fixed pitch propellers. Due to their...
Peter Ulbrich, Rüdiger Kapitza, Christian Har...
ALGORITHMICA
2011
13 years 2 months ago
Knowledge State Algorithms
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct comp...
Wolfgang W. Bein, Lawrence L. Larmore, John Noga, ...
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
SPAA
2003
ACM
14 years 17 days ago
Online oblivious routing
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...