Branching constraint satisfaction problems for solutions robust under likely changes

DOI10.1007/3-540-45349-0_38MaRDI QIDQ4473050zbMATH OpenFDO

Authors David W. Fowler, Kenneth N. Brown

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1894/18940500.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Branching constraint satisfaction problems and Markov decision problems compared
• Robustness and stability in constraint programming under dynamism and uncertainty
• Decision network semantics of branching constraint satisfaction problems
• scientific article; zbMATH DE number 4162300
• Modeling robustness in CSPs as weighted CSPs

Cited in

(10)

• Branch \& Sample: A simple strategy for constraint satisfaction
• Branching constraint satisfaction problems and Markov decision problems compared
• A constraint directed model for partial constraint satisfaction problems
• Generating applicable synthetic instances for branch problems
• Dynamic bundling: Less effort for more solutions
• Modeling robustness in CSPs as weighted CSPs
• Decision network semantics of branching constraint satisfaction problems
• Interleaving solving and elicitation of constraint satisfaction problems based on expected cost
• Constraint solving in uncertain and dynamic environments: A survey
• Stochastic constraint programming: A scenario-based approach

This page was built for publication: Branching constraint satisfaction problems for solutions robust under likely changes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473050)