A value ordering heuristic for local search in distributed resource allocation

DOI10.1007/11402763_7MaRDI QIDQ5703913zbMATH OpenOpenAlexFDO

Authors Adrian Petcu, Boi Faltings

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106890, http://infoscience.epfl.ch/record/52609

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A dynamic distributed constraint satisfaction approach to resource allocation
• Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
• AI 2003: Advances in Artificial Intelligence
• Dynamic distributed resource allocation: A distributed constraint satisfaction approach
• Dynamic Distributed BackJumping

Cited in

(6)

• A distributed optimization method for the geographically distributed data centres problem
• Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems
• Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
• Static heuristics for robust resource allocation of continuously executing applications
• A dynamic distributed constraint satisfaction approach to resource allocation
• Nogood-based asynchronous forward checking algorithms

This page was built for publication: A value ordering heuristic for local search in distributed resource allocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703913)