Sciweavers

55 search results - page 11 / 11
» Oblivious Routing for the Lp-norm
Sort
View
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 5 months ago
Path-independent load balancing with unreliable machines
We consider algorithms for load balancing on unreliable machines. The objective is to optimize the two criteria of minimizing the makespan and minimizing job reassignments in resp...
James Aspnes, Yang Richard Yang, Yitong Yin
ECCC
2007
180views more  ECCC 2007»
13 years 5 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
P2P
2005
IEEE
189views Communications» more  P2P 2005»
13 years 11 months ago
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-l...
Curt Cramer, Thomas Fuhrmann
INFOCOM
2009
IEEE
14 years 5 days ago
Quantifying the Importance of Vantage Points Distribution in Internet Topology Measurements
—The topology of the Internet has been extensively studied in recent years, driving a need for increasingly complex measurement infrastructures. These measurements have produced ...
Yuval Shavitt, Udi Weinsberg
SIROCCO
2007
13 years 7 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...