Sciweavers

4074 search results - page 445 / 815
» Defining Computational Aesthetics
Sort
View
UAI
2001
15 years 8 months ago
Similarity Measures on Preference Structures, Part II: Utility Functions
In previous work [8] we presented a casebased approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user prefe...
Vu A. Ha, Peter Haddawy, John Miyamoto
IJCAI
1997
15 years 8 months ago
Model Minimization, Regression, and Propositional STRIPS Planning
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimization is a well-known technique for reducing ...
Robert Givan, Thomas Dean
WSC
1998
15 years 8 months ago
Informational Macrodynamics: System Modelling and Simulation Methodologies
Informational Macrodynamics (IMD) presents a unified informational systemic approach with common information language for modeling, analysis and optimization of a variety of inter...
Vladimir S. Lerner
MVA
1994
100views Computer Vision» more  MVA 1994»
15 years 8 months ago
Reconstruction of 3-D Terrain Data from Contour Map
This pqm pments a rasterbased algorithm for reconstruction of 3-D terrain data from contour information appearing on the conventional 2-D map The height of an interior point betwe...
Jin-Seon Lee, Seung Jong Chung
CONCUR
2010
Springer
15 years 8 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...