Principles and Practice of Constraint Programming - CP 2006

Principles and Practice of Constraint Programming - CP 2006

4.11 - 1251 ratings - Source

The 12th International Conference on the Principles and Practice of Constraint Programming(CP 2006)washeld inNantes, France, September 24 29, 2006. - formationabouttheconferencecanbefoundontheWebathttp: //www. sciences. univ-nantes. fr/cp06/. Information about past conferences in the series can be found at http: //www. cs. ualberta. ca/ ai/cp/. The CP conference series is the premier international conference on c- straint programming and is held annually. The conference is concerned with all aspects of computing with constraints, including: algorithms, applications, en- ronments, languages, models and systems. This seriesof conferenceswas created to bring together researchers from di?erent disciplines, interested in high-level modeling as well as sound and e?cient resolution of complex optimization and satisfaction problems. Based on this interdisciplinary culture, the CP series of conferences is widely open to di?erent communities of researchers interested in constraint satisfaction, SAT, mathematical programming, problem modeling, system design and implementation, etc. This year, we received 142 submissions. All of the submitted papers received at least three reviews and were discussed in much detail during an online P- gramCommittee meeting. As a result, the ProgramCommittee chose to publish 42 full papers and 21 short papers in the proceedings (the selection rate for this year is 0. 30 for full papers and 0. 46 for all accepted contributions). Following the standard format for CP, the full papers were presented at the conference in two parallel tracks and the short papers were presented as posters during a dedicated session. This year, one paper was selected by a subcommittee of the ProgramCommittee to receivea best paper awar12th International Conference, CP 2006, Nantes, France, September 25-29, 2006 , Proceedings FrAcdAcric Benhamou. the latter algorithm strongly polynomialistheBellman-Ford cutoff, which re- stricts the number of iterations based on the number of ... ASimple TemporalNetwork (STN) [6] is a graph in which the edges are annotated with upper and lower numerical ... in the Bellman- Ford algorithm [4](faster than Floyd-Warshall for sparse graphs, which are common in practical problems).

Title:Principles and Practice of Constraint Programming - CP 2006
Author:Frédéric Benhamou
Publisher:Springer Science & Business Media - 2006-09-26


You Must CONTINUE and create a free account to access unlimited downloads & streaming