Local Computation Schemes with Partially Ordered Preferences

DOI10.1007/978-3-642-02906-6_5zbMATH Open1245.68212OpenAlexW1502876140MaRDI QIDQ3638136FDOQ3638136

Hélène Fargier, Nic Wilson

Publication date: 2 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02906-6_5

Recommendations

• Enabling local computation for partially ordered preferences
• Local computation: lower and upper bounds
• scientific article; zbMATH DE number 1864593
• Experimental and Efficient Algorithms
• Towards a complexity theory for local distributed computing
• On Locality-Sensitive Orderings and Their Applications
• On locality-sensitive orderings and their applications

zbMATH Keywords

dynamical programmingvaluation networks/algebrasoft CSP

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Advances in prospect theory: cumulative representation of uncertainty
• Plausibility measures and default reasoning
• Semiring induced valuation algebras: exact and approximate local computation algorithms
• Title not available (Why is that?)
• Arc consistency for soft constraints
• Title not available (Why is that?)
• The shortest path problem with two objective functions
• Algebraic Structures for Bipolar Constraint-Based Reasoning
• Title not available (Why is that?)
• Bucket elimination for multiobjective optimization problems

Cited In (4)

• Decision making with multiple objectives using GAI networks
• Arranging program statements for locality on the basis of neighbourhood preferences
• Computation in valuation algebras
• Enabling local computation for partially ordered preferences

This page was built for publication: Local Computation Schemes with Partially Ordered Preferences

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