Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Marie Pelleau"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 5, Iss Proc. LSCS 2009, Pp 81-95 (2009)
This paper presents a new method and a constraint-based objective function to solve two problems related to the design of optical telecommunication networks, namely the Synchronous Optical Network Ring Assignment Problem (SRAP) and the Intra-ring Syn
Externí odkaz:
https://doaj.org/article/e504cbabbe2a432bac71ac332872e73f
Publikováno v:
Principles and Practice of Constraint Programming-24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings
Lecture Notes in Computer Science ISBN: 9783319983332
CP
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Principles and Practice of Constraint Programming
CP 2018-24th International Conference on Principles and Practice of Constraint Programming
CP 2018-24th International Conference on Principles and Practice of Constraint Programming, Aug 2018, Lille, France. pp.1-16
Lecture Notes in Computer Science ISBN: 9783319983332
CP
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Principles and Practice of Constraint Programming
CP 2018-24th International Conference on Principles and Practice of Constraint Programming
CP 2018-24th International Conference on Principles and Practice of Constraint Programming, Aug 2018, Lille, France. pp.1-16
International audience; In continuous constraint programming, the solving process alternates propagation steps, which reduce the search space according to the constraints, and branching steps. In practice, the solvers spend a lot of computation time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f792f2133214fe2629b902c22cb7b1ab
Autor:
Marie Pelleau
Constraint Programming aims at solving hard combinatorial problems, with a computation time increasing in practice exponentially. The methods are today efficient enough to solve large industrial problems, in a generic framework. However, solvers are
Publikováno v:
LSCS
Electronic Proceedings in Theoretical Computer Science, Vol 5, Iss Proc. LSCS 2009, Pp 81-95 (2009)
Electronic Proceedings in Theoretical Computer Science, Vol 5, Iss Proc. LSCS 2009, Pp 81-95 (2009)
This paper presents a new method and a constraint-based objective function to solve two problems related to the design of optical telecommunication networks, namely the Synchronous Optical Network Ring Assignment Problem (SRAP) and the Intra-ring Syn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7461e423a76377552e4d9438d2187ad9
https://doi.org/10.4204/eptcs.5.7
https://doi.org/10.4204/eptcs.5.7
Autor:
Marie Pelleau
In this chapter we define a consistency based on octagons as well as a propagation schema. Due to this consistency and to the octagonal abstract domain defined in the previous chapter, we obtain a resolution method based on octagons. A prototype of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c2e4e32f140eec08b9eb8fa0620c1a9
https://doi.org/10.1016/b978-1-78548-010-2.50004-0
https://doi.org/10.1016/b978-1-78548-010-2.50004-0
Autor:
Marie Pelleau
In this chapter we give unified definitions for the different components of the resolution process in constraint programming (CP). With these new definitions, a unique resolution method can be defined for any abstract domain. This new resolution sche
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84d42ab598b3e2ad4ad1f5dc88df78f8
https://doi.org/10.1016/b978-1-78548-010-2.50002-7
https://doi.org/10.1016/b978-1-78548-010-2.50002-7
Autor:
Marie Pelleau
In the previous chapters, we have defined some notions of abstract interpretation (AI) in constraint programming (CP), allowing us to define a unified resolution scheme that does not depend on the chosen abstract domain. This scheme has been implemen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::032e9dfdfdcb7da3ebe84d283a5dee1e
https://doi.org/10.1016/b978-1-78548-010-2.50005-2
https://doi.org/10.1016/b978-1-78548-010-2.50005-2