scientific article; zbMATH DE number 2080330

MaRDI QIDQ4473050zbMATH OpenFDO

Authors David W. Fowler, Kenneth N. Brown

Publication date 4 August 2004

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)

• Decision network semantics of branching constraint satisfaction problems
• Generating applicable synthetic instances for branch problems
• Branching constraint satisfaction problems and Markov decision problems compared
• Stochastic constraint programming: A scenario-based approach
• Modeling robustness in CSPs as weighted CSPs
• Branch \& Sample: A simple strategy for constraint satisfaction
• Interleaving solving and elicitation of constraint satisfaction problems based on expected cost
• scientific article; zbMATH DE number 1696546 (Why is no real title available?)
• Constraint solving in uncertain and dynamic environments: A survey
• scientific article; zbMATH DE number 2086968 (Why is no real title available?)

This page was built for publication:

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