scientific article; zbMATH DE number 2080330

zbMATH Open1044.68759MaRDI QIDQ4473050FDOQ4473050

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

Title of this publication is not available (Why is that?)

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
• Publication:3489491
• Modeling robustness in CSPs as weighted CSPs

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constraint solving in uncertain and dynamic environments: A survey

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)