the proceedings contain 68 papers. the topics discussed include: a modular architecture for hybrid planning withtheories;teaching constraintprogramming;one problem, two structures, six solvers, and ten years of pers...
ISBN:
(纸本)9783319104270
the proceedings contain 68 papers. the topics discussed include: a modular architecture for hybrid planning withtheories;teaching constraintprogramming;one problem, two structures, six solvers, and ten years of personnel scheduling;concurrent constraintprogramming research programs - redux;on broken triangles;a complete solver for constraint games;sequential time splitting and bounds communication for a portfolio of optimization solvers;scoring-based neighborhood dominance for the subgraph isomorphism problem;linking prefixes and suffixes for constraints encoded using automata with accumulators;the propagation depth of local consistency;the balance constraint family;on backdoors to tractable constraint languages;and a new characterization of relevant intervals for energetic reasoning.
At the first PPcpconference in 1995, I was honored to be one of the invited speakers. Twenty conferences later, much has changed in the computational *** have seen the penetration of the Internet in every aspect of h...
ISBN:
(纸本)9783319104287;9783319104270
At the first PPcpconference in 1995, I was honored to be one of the invited speakers. Twenty conferences later, much has changed in the computational *** have seen the penetration of the Internet in every aspect of human life; the establishment of the multi-core era; the arrival of petaflop high performance computing; the rise of big data, analytics and machine learning; and the emergence of the planet-wide computer (the “cloud-.
How do we do research?We start with a question. then we read books, journal and conference papers, maybe even speak to people. then we do our own work, make our own contribution, maybe coming up with an improved techn...
详细信息
ISBN:
(纸本)9783319104287;9783319104270
How do we do research?We start with a question. then we read books, journal and conference papers, maybe even speak to people. then we do our own work, make our own contribution, maybe coming up with an improved technique or a greater *** then write up our findings, maybe submit this to a conference, present our work and get feedback, and this results in further research. this is a feedback loop, open to scrutiny by our peers.
this special issue of theory and practice of Logic programming (TPLP) contains the regular papers accepted for presentation at the 33rd internationalconference on Logic programming (ICLP 2017), held in Melbourne, Aus...
详细信息
this special issue of theory and practice of Logic programming (TPLP) contains the regular papers accepted for presentation at the 33rd internationalconference on Logic programming (ICLP 2017), held in Melbourne, Australia from the 28th of August to the 1st of September, 2017. ICLP 2017 was colocated withthe 23rd internationalconference on principles and practice of constraintprogramming (cp2017) and the 20thinternationalconference on theory and Applications of Satisfiability Testing (SAT 2017). Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming.
Bounded Max-Sum is a message-passing algorithm for solving Distributed constraint Optimization Problems (DCOP) able to compute solutions with a guaranteed approximation ratio. In this paper we show that the introducti...
详细信息
ISBN:
(纸本)9783319104287;9783319104270
Bounded Max-Sum is a message-passing algorithm for solving Distributed constraint Optimization Problems (DCOP) able to compute solutions with a guaranteed approximation ratio. In this paper we show that the introduction of an intermediate step that decomposes functions may significantly improve its accuracy. this is especially relevant in critical applications (e. g. automatic surveillance, disaster response scenarios) where the accuracy of solutions is of vital importance.
We introduce new cp models for the many-to-many stable matching problem. We use the notion of rotation to give a novel encoding that is linear in the input size of the problem. We give extra filtering rules to maintai...
详细信息
ISBN:
(纸本)9783319661582;9783319661575
We introduce new cp models for the many-to-many stable matching problem. We use the notion of rotation to give a novel encoding that is linear in the input size of the problem. We give extra filtering rules to maintain arc consistency in quadratic time. Our experimental study on hard instances of sex-equal and balanced stable matching shows the efficiency of one of our propositions as compared withthe state-of-the-art constraintprogramming approach.
Although the Steel Mill Slab problem (prob 38 of CSPLib) has already been studied by the cp community, this approach is unfortunately not used anymore by steel producers since last century. Continuous casting is prefe...
详细信息
ISBN:
(纸本)9783319104287;9783319104270
Although the Steel Mill Slab problem (prob 38 of CSPLib) has already been studied by the cp community, this approach is unfortunately not used anymore by steel producers since last century. Continuous casting is preferred instead, allowing higher throughput and better steel quality. this paper presents a cp model related to scheduling of operations for steel making with continuous casting. Activities considered range from the extraction of iron in the furnace to its casting in continuous casters. We describe the problem, detail a cp scheduling model that is finally used to solve real-life instances of some of the PSI Metals' customers.
We present a parallel solver for numerical constraint satisfaction problems (NCSPs) that can scale on a number of cores. Our proposed method runs worker solvers on the available cores and simultaneously the workers co...
详细信息
ISBN:
(纸本)9783319104287;9783319104270
We present a parallel solver for numerical constraint satisfaction problems (NCSPs) that can scale on a number of cores. Our proposed method runs worker solvers on the available cores and simultaneously the workers cooperate for the search space distribution and balancing. In the experiments, we attained up to 119-fold speedup using 256 cores of a parallel computer.
We describe an optimization application in the context of steel manufacturing, to design and schedule batches for annealing furnaces. Our solution approach uses a two-phase decomposition. the first phase groups togeth...
详细信息
ISBN:
(纸本)9783319661582;9783319661575
We describe an optimization application in the context of steel manufacturing, to design and schedule batches for annealing furnaces. Our solution approach uses a two-phase decomposition. the first phase groups together orders into batches using a mixed-integer linear programming model. the second phase assigns the batches to furnaces and schedules them over time, using constraintprogramming. Our solution has been developed for operational use in two plants of a steel manufacturer in North America.
暂无评论