Local Computation Schemes with Partially Ordered Preferences
From MaRDI portal
(Redirected from Publication:3638136)
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
Cites work
- scientific article; zbMATH DE number 4174344 (Why is no real title available?)
- scientific article; zbMATH DE number 19878 (Why is no real title available?)
- scientific article; zbMATH DE number 1945067 (Why is no real title available?)
- Advances in prospect theory: cumulative representation of uncertainty
- Algebraic Structures for Bipolar Constraint-Based Reasoning
- Arc consistency for soft constraints
- Bucket elimination for multiobjective optimization problems
- Plausibility measures and default reasoning
- Semiring induced valuation algebras: exact and approximate local computation algorithms
- The shortest path problem with two objective functions
Cited in
(6)- Decision making with multiple objectives using GAI networks
- Arranging program statements for locality on the basis of neighbourhood preferences
- Generic local computation
- Enabling local computation for partially ordered preferences
- Computation in valuation algebras
- An axiomatic framework for influence diagram computation with 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)
