Sciweavers

7092 search results - page 103 / 1419
» Parallelizing constraint programs
Sort
View
87
Voted
ECAI
2006
Springer
15 years 4 months ago
Multi-Objective Propagation in Constraint Programming
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
Emma Rollon, Javier Larrosa
102
Voted
ICLP
1995
Springer
15 years 4 months ago
Operational Semantics of Constraint Logic Programs with Coroutining
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
Andreas Podelski, Gert Smolka
ENTCS
2007
190views more  ENTCS 2007»
15 years 2 days ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
96
Voted
ACL
1998
15 years 1 months ago
Learning Constraint Grammar-style Disambiguation Rules using Inductive Logic Programming
This paper reports a pilot study, in which Constraint Grammar inspiredruleswere learnt using the Progol machine-learning system. Rules discarding faulty readings of ambiguously ta...
Nikolaj Lindberg, Martin Eineborg
137
Voted
CP
2010
Springer
14 years 11 months ago
Propagating the Bin Packing Constraint Using Linear Programming
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
Hadrien Cambazard, Barry O'Sullivan