Sciweavers

7988 search results - page 1282 / 1598
» A Useful Undecidable Theory
Sort
View
AAAI
1998
15 years 8 months ago
Iterated Phantom Induction: A Little Knowledge Can Go a Long Way
Weadvance a knowledge-based learning method that augments conventional generalization to permit concept acquisition in failure domains. These are domains in whichlearning must pro...
Mark Brodie, Gerald DeJong
AAAI
1998
15 years 8 months ago
Boosting in the Limit: Maximizing the Margin of Learned Ensembles
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...
Adam J. Grove, Dale Schuurmans
AAAI
2000
15 years 8 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
SODA
2003
ACM
142views Algorithms» more  SODA 2003»
15 years 8 months ago
The similarity metric
—A new class of distances appropriate for measuring similarity relations between sequences, say one type of similarity per distance, is studied. We propose a new “normalized in...
Ming Li, Xin Chen, Xin Li, Bin Ma, Paul M. B. Vit&...
UAI
2003
15 years 8 months ago
Learning Continuous Time Bayesian Networks
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
Uri Nodelman, Christian R. Shelton, Daphne Koller
« Prev « First page 1282 / 1598 Last » Next »