Pages that link to "Item:Q2536444"

The following pages link to Contribution to nonserial dynamic programming (Q2536444):

Displaying 31 items.

• Decision making with multiple objectives using GAI networks (Q646528) (← links)
• Computing rank dependent utility in graphical models for sequential decision problems (Q646548) (← links)
• A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
• Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
• Efficient approximate linear programming for factored MDPs (Q899136) (← links)
• Some tractable instances of interval data minmax regret problems (Q1003488) (← links)
• The principle of optimality in the design of efficient algorithms (Q1085609) (← links)
• Nonserial dynamic programming formulations of satisfiability (Q1099093) (← links)
• Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← links)
• Optimal mass production (Q1140429) (← links)
• Studies on hypergraphs. I: Hyperforests (Q1209154) (← links)
• The frontal method based on mechanics and dynamic programming (Q1241967) (← links)
• A comparison of graphical techniques for decision analysis (Q1341983) (← links)
• Optimal resource leveling using non-serial dynamic programming (Q1341995) (← links)
• The design of a 0-1 integer optimizer and its application in the Carmen system (Q1390346) (← links)
• Irrelevance and parameter learning in Bayesian networks (Q1391914) (← links)
• Local and global relational consistency (Q1391940) (← links)
• Decentralized decision-making in a large team with local information. (Q1399517) (← links)
• Binary join trees for computing marginals in the Shenoy-Shafer architecture (Q1809373) (← links)
• Optimal procedures for dynamic programs with complex loop structures (Q1821703) (← links)
• A logical approach to efficient Max-SAT solving (Q2389619) (← links)
• Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering (Q2457595) (← links)
• Constraint-based optimization and utility elicitation using the minimax decision criterion (Q2457617) (← links)
• Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
• Efficient operation of natural gas transmission systems: a network-based heuristic for cyclic structures (Q2489290) (← links)
• A theorem in nonserial dynamic programming (Q2538060) (← links)
• Nonserial dynamic programming: On the optimal strategy of variable elimination for the rectangular lattice (Q2543581) (← links)
• On the theory of the elimination process (Q2551436) (← links)
• On non-serial dynamic programming (Q2561771) (← links)
• A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems (Q4726075) (← links)
• Characterizing and generalizing cycle completable graphs (Q6184532) (← links)