The Community for Technology Leaders
RSS Icon
Subscribe
Santiago, Chile
Apr. 22, 2009 to Apr. 24, 2009
ISBN: 978-1-4244-3534-0
pp: 252-257
Fabricio Enembreck , PUCPR ¿ Pontifical Catholic University of Paraná, Brazil
Edson Emilio Scalabrin , PUCPR ¿ Pontifical Catholic University of Paraná, Brazil
Braulio Coelho Avila , PUCPR ¿ Pontifical Catholic University of Paraná, Brazil
Jean-Paul Barthes , UTC ¿ Université de Technologie de Compiègne, France
ABSTRACT
This paper introduces a new agent-based algorithm for scheduling in CSCWD. Distributed Artificial Intelligence provides a lot of research areas, including CSCWD, with efficient decentralized optimization and problem solving techniques. In this paper we focus on how DCOP (Distributed Constraint Optimization Problem) can be used for scheduling in CSCWD, discussing a new algorithm. Our algorithm is almost-complete, providing the best solution most the times. However, it saves a lot of computational resources, being useful in situations where other state of the art algorithms are not feasible. The results are quite encouraging, showing that our algorithm outperforms easily two well-known DCOP algorithms in terms of runtime, number of messages, size of messages and throughput.
CITATION
Fabricio Enembreck, Edson Emilio Scalabrin, Braulio Coelho Avila, Jean-Paul Barthes, "Distributed Constraint Optimization for scheduling in CSCWD", CSCWD, 2009, International Conference on Computer Supported Cooperative Work in Design, International Conference on Computer Supported Cooperative Work in Design 2009, pp. 252-257, doi:10.1109/CSCWD.2009.4968067
7 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool