We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decisions based only on local information, and full inference methods that guarantee completeness.
Titre
A hybrid of inference and local search for distributed combinatorial optimization
Publié dans
Proceedings Of The Ieee/Wic/Acm International Conference On Intelligent Agent Technology (Iat 2007)
Pages
342-348
Présenté à
IEEE/WIC/ACM International Conference on Intelligent Agent Technology and Web Intelligence, Fremont, CA, Nov 02-05, 2007
Date
2007
Editeur
Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa
ISBN
978-0-7695-3027-7
Date de création de la notice
2012-07-04
