Abstract
In this work, we present a distributed model for solving large-scale CSPs. Our technique carries out a partition over the constraint network by a graph partitioning software, such as each subproblem is as independent as possible and, it can be solved in a reasonable time. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
APA
Abril, M., Salido, M. A., & Barber, F. (2005). Distributed constraints for large-scale scheduling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, p. 837). https://doi.org/10.1007/11564751_75
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free