Sciweavers

3229 search results - page 525 / 646
» The Theory of Timed Automata
Sort
View
AAAI
1996
15 years 7 months ago
Rewarding Behaviors
Markov decision processes (MDPs) are a very popular tool for decision theoretic planning (DTP), partly because of the welldeveloped, expressive theory that includes effective solu...
Fahiem Bacchus, Craig Boutilier, Adam J. Grove
AAAI
1996
15 years 7 months ago
Building Classifiers Using Bayesian Networks
Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competit...
Nir Friedman, Moisés Goldszmidt
AAAI
1990
15 years 7 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih
DBWORKSHOPS
1992
15 years 7 months ago
An Incremental Concept Formation Approach for Learning from Databases
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
Rokia Missaoui, Robert Godin
AIIDE
2009
15 years 7 months ago
Improving Offensive Performance Through Opponent Modeling
Although in theory opponent modeling can be useful in any adversarial domain, in practice it is both difficult to do accurately and to use effectively to improve game play. In thi...
Kennard Laviers, Gita Sukthankar, David W. Aha, Ma...