We define the distributed continuous-time combinatorial optimization problem. We propose a new notion of solution stability in aynamic optimization, based on the cost Of change from an already-implemented solution to the new one. Change costs are modeled with stability constraints, and can evolve over time.
Titre
Optimal solution stability in dynamic, distributed constraint optimization
Publié dans
Proceedings Of The Ieee/Wic/Acm International Conference On Intelligent Agent Technology (Iat 2007)
Pages
321-327
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
