208 search results - page 26 / 42 » Decomposition Techniques for a Loosely-Coupled Resource Allo... |
ATAL
2011
Springer
12 years 8 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
ICCS
2009
Springer
14 years 3 months ago
2009
Springer
BOINC is a middleware for Volunteer Computing. In BOINC projects, heterogeneous resources distributed across the Internet are used for large-scale scientific simulations. The larg...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
SASO
2008
IEEE
14 years 2 months ago
2008
IEEE
Many authors recognize the limitations of hierarchical Grid scheduling in scalable environments, and proposed peer-to-peer solutions to this problem. However, most peerto-peer gri...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
In many half-duplex cooperative systems, the direct formulation of the problem of finding the jointly optimal power and channel resource allocation that maximizes a weighted sum ...