Sciweavers

2038 search results - page 365 / 408
» Loops under Strategies
Sort
View
WWW
2005
ACM
14 years 9 months ago
Improving Web search efficiency via a locality based static pruning method
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
Edleno Silva de Moura, Célia Francisca dos ...
WWW
2003
ACM
14 years 9 months ago
The chatty web: emergent semantics through gossiping
This paper describes a novel approach for obtaining semantic interoperability among data sources in a bottom-up, semiautomatic manner without relying on pre-existing, global seman...
Karl Aberer, Manfred Hauswirth, Philippe Cudr&eacu...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 9 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
SPAA
2009
ACM
14 years 9 months ago
Buffer management for colored packets with deadlines
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Mosci...
PODC
2009
ACM
14 years 9 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...