The following pages link to Constraints (Q202524):
Displaying 50 items.
- Enabling local computation for partially ordered preferences (Q606907) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Resolution-based lower bounds in MaxSAT (Q606913) (← links)
- Preference reasoning with soft constraints in constraint-based recommender systems (Q606917) (← links)
- Interleaving solving and elicitation of constraint satisfaction problems based on expected cost (Q606920) (← links)
- Constraint programming approach to a bilevel scheduling problem (Q647473) (← links)
- Explaining the \texttt{cumulative} propagator (Q647477) (← links)
- Data transfer planning with tree placement for collaborative environments (Q647480) (← links)
- Hybrid search for minimal perturbation in dynamic CSPs (Q647481) (← links)
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class (Q679419) (← links)
- Interval propagation to reason about sets: Definition and implementation of a practical language (Q679421) (← links)
- Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem (Q679422) (← links)
- TimeC: A time constraint language for ILP processor compilation (Q698076) (← links)
- Shape reconstruction incorporating multiple nonlinear geometric constraints (Q698081) (← links)
- A new approach for weighted constraint satisfaction (Q698082) (← links)
- A constraint-based interactive train rescheduling tool (Q698087) (← links)
- Fourier elimination for compiling constraint hierarchies (Q698090) (← links)
- On benchmarking constraint logic programming platforms. Response to Fernández and Hill's ``A comparative study of eight constraint programming languages over the Boolean and finite domains'' (Q704657) (← links)
- Disunification in ACI1 theories (Q704658) (← links)
- Special issue: Principles and practice of constraint programming. Selected papers based on the presentation at the 9th international conference (CP 2003), Cork, Ireland, September 29 -- October 3, 2003. (Q816673) (← links)
- Periodic constraint satisfaction problems: Tractable subclasses (Q816674) (← links)
- An efficient bounds consistency algorithm for the global cardinality constraint (Q816677) (← links)
- Control abstractions for local search (Q816678) (← links)
- Maintaining longest paths incrementally (Q816679) (← links)
- Complete bound consistency for the global cardinality constraint (Q816681) (← links)
- Rewriting union queries using views (Q816684) (← links)
- Constraint solving in uncertain and dynamic environments: A survey (Q816686) (← links)
- High-order consistency in valued constraint satisfaction (Q816687) (← links)
- Invariants for time-series constraints (Q823762) (← links)
- Non-local configuration of component interfaces by constraint satisfaction (Q823765) (← links)
- The flexible and real-time commute trip sharing problems (Q823767) (← links)
- Efficient multiple constraint acquisition (Q823769) (← links)
- Learning optimal decision trees using constraint programming (Q823772) (← links)
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← links)
- Exact and flexible solution approach to a critical chain project management problem (Q823776) (← links)
- Introduction to the CPAIOR 2020 fast track issue (Q823777) (← links)
- Power of pre-processing: production scheduling with variable energy pricing and power-saving states (Q823779) (← links)
- Cost-based filtering techniques for stochastic inventory control under service level constraints (Q842783) (← links)
- Min-domain retroactive ordering for asynchronous backtracking (Q842785) (← links)
- Distributed constraint satisfaction with partially known constraints (Q842788) (← links)
- Propagating systems of dense linear integer constraints (Q842789) (← links)
- Compiling finite linear CSP into SAT (Q842794) (← links)
- New filtering algorithms for combinations of among constraints (Q842795) (← links)
- Statistical regimes across constrainedness regions (Q850446) (← links)
- Reformulation of global constraints based on constraints checkers (Q850448) (← links)
- Contraint-based combinators for local search (Q850450) (← links)
- A hybrid method for the planning and scheduling (Q850451) (← links)
- Extension of \(O(n \log n)\) filtering algorithms for the unary resource constraint to optional activities (Q850453) (← links)
- On topological consistency and realization (Q850454) (← links)
- A constraint-based approach to fast and exact structure prediction in three-dimensional protein models (Q850456) (← links)
