Sciweavers

292 search results - page 15 / 59
» Are Stable Instances Easy
Sort
View
89
Voted
AAAI
2004
15 years 2 months ago
GROWRANGE: Anytime VCG-Based Mechanisms
We introduce anytime mechanisms for distributed optimization with self-interested agents. Anytime mechanisms retain good incentive properties even when interrupted before the opti...
David C. Parkes, Grant Schoenebeck
84
Voted
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
16 years 1 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
ICSOC
2009
Springer
14 years 10 months ago
EC2 Performance Analysis for Resource Provisioning of Service-Oriented Applications
Abstract. Cloud computing is receiving increasingly attention as it provides infinite resource capacity and "pay-as-you-go" resource usage pattern to hosted applications....
Dejun Jiang, Guillaume Pierre, Chi-Hung Chi
119
Voted
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
15 years 2 months ago
A fractional model of the border gateway protocol (BGP)
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
COR
2006
98views more  COR 2006»
15 years 23 days ago
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
Willem Jan van Hoeve