A distributed optimization method for the geographically distributed data centres problem
From MaRDI portal
Publication:2011585
Recommendations
- scientific article; zbMATH DE number 2088163
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- Distributed Gibbs: a linear-space sampling-based DCOP algorithm
- scientific article; zbMATH DE number 2084748
- A centre-free approach for resource allocation with lower bounds
Cites work
- scientific article; zbMATH DE number 1573293 (Why is no real title available?)
- scientific article; zbMATH DE number 5547971 (Why is no real title available?)
- A generic arc-consistency algorithm and its specializations
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- Approximations in Distributed Optimization
- Asynchronous backtracking without adding links: a new member in the ABT family
- Asynchronous forward-checking for DisCSPs
- BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
- Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
- Distributed constraint satisfaction with partially known constraints
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
- Dynamic Ordering for Asynchronous Backtracking on DisCSPs
- Nogood-based asynchronous forward checking algorithms
- Recent Advances in Constraints
- The distributed breakout algorithms
Cited in
(2)
This page was built for publication: A distributed optimization method for the geographically distributed data centres problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011585)