Sciweavers

1684 search results - page 18 / 337
» The lexicographic decision function
Sort
View
IJCAI
2003
13 years 11 months ago
Skewing: An Efficient Alternative to Lookahead for Decision Tree Induction
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the st...
David Page, Soumya Ray
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
13 years 11 months ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...
AAAI
2006
13 years 11 months ago
Learning Representation and Control in Continuous Markov Decision Processes
This paper presents a novel framework for simultaneously learning representation and control in continuous Markov decision processes. Our approach builds on the framework of proto...
Sridhar Mahadevan, Mauro Maggioni, Kimberly Fergus...
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
14 years 1 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
IJCAI
2003
13 years 11 months ago
On the Foundations of Expected Expected Utility
Intelligent agents often need to assess user utility functions in order to make decisions on their behalf, or predict their behavior. When uncertainty exists over the precise natu...
Craig Boutilier