Sciweavers

3373 search results - page 147 / 675
» Naturalistic Decision Making
Sort
View
IFIP12
2004
13 years 10 months ago
An Interactive Multicriteria Optimisation Approach to Scheduling
Scheduling problems overall assume that it is possible to identify stable criteria definitions measuring the quality of alternatives. In real world problems however, this does not ...
Martin Josef Geiger, Sanja Petrovic
ICAI
2009
13 years 6 months ago
The Utility of Affect in the Selection of Actions and Goals Under Real-World Constraints
We present a novel affective goal selection mechanism for decision-making in agents with limited computational resources (e.g., such as robots operating under real-time constraint...
Paul W. Schermerhorn, Matthias Scheutz
ICML
2005
IEEE
14 years 10 months ago
Bayesian sparse sampling for on-line reward optimization
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
CADE
2007
Springer
14 years 9 months ago
T-Decision by Decomposition
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
Maria Paola Bonacina, Mnacho Echenim
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
14 years 9 months ago
Reimer's inequality and tardos' conjecture
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
Clifford D. Smyth