178 search results - page 5 / 36 » Bounds, Heuristics, and Approximations for Distribution Syst... |
AAIM
2007
Springer
15 years 4 months ago
2007
Springer
BitTorrent (BT) in practice is a very efficient method to share data over a network of clients. In this paper we extend the recent work of Arthur and Panigrahy [1] on modelling the...
105
click to vote
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
In this study we deal with the mixing problem, which concerns combining the prediction of independently trained local models to form a global prediction. We deal with it from the ...
108
click to vote
ISORC
2005
IEEE
15 years 6 months ago
2005
IEEE
Heuristic algorithms have enjoyed increasing interests and success in the context of Utility Accrual (UA) scheduling. However, few analytical results, such as bounds on task-level...
107
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
129
Voted
DC
2008
15 years 15 days ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...