Sciweavers

2410 search results - page 37 / 482
» Multiset Ordering Constraints
Sort
View
CONSTRAINTS
2006
105views more  CONSTRAINTS 2006»
15 years 4 months ago
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
Y. Law, J. Lee
ECAI
2000
Springer
15 years 8 months ago
Extensions of Constraint Solving for Proof Planning
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver s...
Erica Melis, Jürgen Zimmer, Tobias Mülle...
EOR
2006
81views more  EOR 2006»
15 years 4 months ago
Optimal and near-optimal policies for lost sales inventory models with at most one replenishment order outstanding
In this paper we use policy-iteration to explore the behaviour of optimal control policies for lost sales inventory models with the constraint that not more than one replenishment...
Roger M. Hill, Søren Glud Johansen
126
Voted
FLAIRS
2003
15 years 5 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
ICCAD
1994
IEEE
101views Hardware» more  ICCAD 1994»
15 years 8 months ago
A general framework for vertex orderings, with applications to netlist clustering
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
Charles J. Alpert, Andrew B. Kahng