Sciweavers

3229 search results - page 53 / 646
» Theories with the Independence Property
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 3 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
COMPLEX
2009
Springer
14 years 3 months ago
Comparing Networks from a Data Analysis Perspective
To probe network characteristics, two predominant ways of network comparison are global property statistics and subgraph enumeration. However, they suffer from limited information...
Wei Li, Jing-Yu Yang
IMC
2003
ACM
14 years 1 months ago
Simple network performance tomography
In network performance tomography, characteristics of the network interior are inferred by correlating end-to-end measurements. In much previous work, the presence of correlations...
Nick G. Duffield
SIGCOMM
1994
ACM
14 years 23 days ago
Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and sel sh, and (2) central admini...
Scott Shenker
EMSOFT
2007
Springer
14 years 19 days ago
Necessary and sufficient conditions for deterministic desynchronization
Synchronous reactive formalisms associate concurrent behaviors to precise schedules on global clock(s). This allows a non-ambiguous notion of "absent" signal, which can ...
Dumitru Potop-Butucaru, Robert de Simone, Yves Sor...