Sciweavers

16128 search results - page 2928 / 3226
» Distributed network scheduling
Sort
View
CCGRID
2005
IEEE
16 years 8 days ago
P3: P2P-based middleware enabling transfer and aggregation of computational resources
This paper presents middleware enabling mutual and equal transfer of computing power between individuals, as in the original idea behind P2P, while also supporting large-scale dis...
Kazuyuki Shudo, Yoshio Tanaka, Satoshi Sekiguchi
ICDCS
2005
IEEE
16 years 7 days ago
Timer Interaction in Route Flap Damping
Route Flap Damping is a mechanism generally used in network routing protocols. Its goal is to limit the global impact of unstable routes by temporarily suppressing routes with rap...
Beichuan Zhang, Dan Pei, Daniel Massey, Lixia Zhan...
PODC
2005
ACM
16 years 6 days ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking
181
Voted
SPAA
2005
ACM
16 years 6 days ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
WINE
2005
Springer
161views Economy» more  WINE 2005»
16 years 3 days ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
« Prev « First page 2928 / 3226 Last » Next »