Sciweavers

4514 search results - page 869 / 903
» Distributed Optimization in Adaptive Networks
Sort
View
SIGCOMM
2012
ACM
12 years 15 days ago
Finishing flows quickly with preemptive scheduling
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
Chi-Yao Hong, Matthew Caesar, Brighten Godfrey
ICDE
2003
IEEE
73views Database» more  ICDE 2003»
14 years 11 months ago
Scalable Application-Aware Data Freshening
Distributed databases and other networked information systems use copies or mirrors to reduce latency and to increase availability. Copies need to be refreshed. In a loosely coupl...
Donald Carney, Sangdon Lee, Stanley B. Zdonik
ICML
1995
IEEE
14 years 11 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 10 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
WWW
2010
ACM
14 years 5 months ago
Autonomous resource provisioning for multi-service web applications
Dynamic resource provisioning aims at maintaining the endto-end response time of a web application within a predefined SLA. Although the topic has been well studied for monolithi...
Dejun Jiang, Guillaume Pierre, Chi-Hung Chi