Sciweavers

1684 search results - page 49 / 337
» The lexicographic decision function
Sort
View
ECCC
2010
108views more  ECCC 2010»
14 years 7 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...
CADE
2004
Springer
15 years 10 months ago
Decision Procedures for Recursive Data Structures with Integer Constraints
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus prov...
Ting Zhang, Henny B. Sipma, Zohar Manna
COLT
2007
Springer
15 years 4 months ago
Bounded Parameter Markov Decision Processes with Average Reward Criterion
Bounded parameter Markov Decision Processes (BMDPs) address the issue of dealing with uncertainty in the parameters of a Markov Decision Process (MDP). Unlike the case of an MDP, t...
Ambuj Tewari, Peter L. Bartlett
IUI
2000
ACM
15 years 2 months ago
Creating an empirical basis for adaptation decisions
CT How can an adaptive intelligent interface decide what particular action to perform in a given situation, as a function of perceived properties of the user and the situation? Ide...
Anthony Jameson, Barbara Großmann-Hutter, Le...
KR
1994
Springer
15 years 1 months ago
Risk-Sensitive Planning with Probabilistic Decision Graphs
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
Sven Koenig, Reid G. Simmons