Sciweavers

1449 search results - page 101 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
IJCAI
2003
15 years 7 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
UAI
2004
15 years 7 months ago
The Minimum Information Principle for Discriminative Learning
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
Amir Globerson, Naftali Tishby
UAI
2004
15 years 7 months ago
Computing Nash Equilibria of Action-Graph Games
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
Navin A. R. Bhat, Kevin Leyton-Brown
UAI
2004
15 years 7 months ago
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space
The paper introduces mixed networks, a new framework for expressing and reasoning with probabilistic and deterministic information. The framework combines belief networks with con...
Rina Dechter, Robert Mateescu
AAAI
1998
15 years 7 months ago
Boosting Combinatorial Search Through Randomization
Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of "heavy-tailed cost distributions", meaning that at any tim...
Carla P. Gomes, Bart Selman, Henry A. Kautz