Constraint solving in uncertain and dynamic environments: A survey
From MaRDI portal
(Redirected from Publication:816686)
Recommendations
Cites work
- scientific article; zbMATH DE number 4174370 (Why is no real title available?)
- scientific article; zbMATH DE number 4209573 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1149402 (Why is no real title available?)
- scientific article; zbMATH DE number 2080311 (Why is no real title available?)
- scientific article; zbMATH DE number 2080330 (Why is no real title available?)
- Branching constraint satisfaction problems and Markov decision problems compared
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
- Constraint retraction in CLP(FD): Formal framework and performance results
- Experiments in reactive constraint logic programming1This paper is the complete version of a previous paper published in [14].1
- Fuzzy \(rr\)DFCSP and planning
- Graph-Based Algorithms for Boolean Function Manipulation
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Local search with constraint propagation and conflict-based heuristics
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Network-based heuristics for constraint-satisfaction problems
- Open constraint programming
- Probe backtrack search for minimal perturbation in dynamic scheduling
- Remote Agent: to boldly go where no AI system has gone before
- Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
- Solving mixed and conditional constraint satisfaction problems
- Stochastic Boolean satisfiability
- Stochastic constraint programming: A scenario-based approach
- Stochastic dynamic programming with factored representations
- Supporting dispatchability in schedules with consumable resources
- Temporal constraint networks
- The logic of constraint satisfaction
- Ultraviolet: A constraint satisfaction algorithm for interactive graphics
Cited in
(11)- Robustness and stability in constraint programming under dynamism and uncertainty
- Handling structured and ambiguous constraints in constraint satisfaction problems
- Hybrid search for minimal perturbation in dynamic CSPs
- Modeling robustness in CSPs as weighted CSPs
- Explanation-based large neighborhood search
- Nature-inspired techniques for dynamic constraint satisfaction problems
- Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
- Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems
- scientific article; zbMATH DE number 2084768 (Why is no real title available?)
- Quality recovering of university timetables
- Contractibility for open global constraints
This page was built for publication: Constraint solving in uncertain and dynamic environments: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q816686)
