Sciweavers

408 search results - page 16 / 82
» A lookahead strategy for solving large planning problems
Sort
View
UAI
2008
14 years 11 months ago
Strategy Selection in Influence Diagrams using Imprecise Probabilities
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
Cassio Polpo de Campos, Qiang Ji
ISDA
2010
IEEE
14 years 7 months ago
Avoiding simplification strategies by introducing multi-objectiveness in real world problems
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
Charlotte J. C. Rietveld, Gijs P. Hendrix, Frank T...
CPAIOR
2005
Springer
15 years 3 months ago
Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations
We describe the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne telescope. The problem requires maximizing the nu...
Jeremy Frank, Elif Kürklü
CP
2008
Springer
14 years 11 months ago
Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies
Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications. ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
76
Voted
AI
2010
Springer
14 years 9 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...