Contribution to nonserial dynamic programming
From MaRDI portal
Publication:2536444
DOI10.1016/0022-247X(69)90030-4zbMath0187.17801MaRDI QIDQ2536444
U. Bertele, Francesco Brioschi
Publication date: 1969
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items
The principle of optimality in the design of efficient algorithms, A comparison of graphical techniques for decision analysis, Optimal resource leveling using non-serial dynamic programming, Nonserial dynamic programming formulations of satisfiability, A logical approach to efficient Max-SAT solving, Linear time algorithms for NP-hard problems restricted to partial k- trees, The design of a 0-1 integer optimizer and its application in the Carmen system, Irrelevance and parameter learning in Bayesian networks, Local and global relational consistency, Optimal mass production, Decentralized decision-making in a large team with local information., Efficient approximate linear programming for factored MDPs, Characterizing and generalizing cycle completable graphs, Decision making with multiple objectives using GAI networks, Computing rank dependent utility in graphical models for sequential decision problems, Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering, Constraint-based optimization and utility elicitation using the minimax decision criterion, Partition-based logical reasoning for first-order and propositional theories, Studies on hypergraphs. I: Hyperforests, Efficient operation of natural gas transmission systems: a network-based heuristic for cyclic structures, Topological parameters for time-space tradeoff, The frontal method based on mechanics and dynamic programming, Some tractable instances of interval data minmax regret problems, Binary join trees for computing marginals in the Shenoy-Shafer architecture, A theorem in nonserial dynamic programming, Nonserial dynamic programming: On the optimal strategy of variable elimination for the rectangular lattice, Optimal procedures for dynamic programs with complex loop structures, A high-level computing algorithm for diverging and converging branch nonserial dynamic programming systems, On the theory of the elimination process, On non-serial dynamic programming, A faster tree-decomposition based algorithm for counting linear extensions, Parameterized leaf power recognition via embedding into graph products
Cites Work
