Sciweavers

797 search results - page 149 / 160
» Bayesian Robot Programming
Sort
View
ESANN
2004
13 years 9 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk
AAAI
2000
13 years 9 months ago
Decision Making under Uncertainty: Operations Research Meets AI (Again)
Models for sequential decision making under uncertainty (e.g., Markov decision processes,or MDPs) have beenstudied in operations research for decades. The recent incorporation of ...
Craig Boutilier
AI
2010
Springer
13 years 7 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
BMCBI
2006
111views more  BMCBI 2006»
13 years 7 months ago
SIMMAP: Stochastic character mapping of discrete traits on phylogenies
Background: Character mapping on phylogenies has played an important, if not critical role, in our understanding of molecular, morphological, and behavioral evolution. Until very ...
Jonathan P. Bollback
AI
1998
Springer
13 years 7 months ago
Model-Based Average Reward Reinforcement Learning
Reinforcement Learning (RL) is the study of programs that improve their performance by receiving rewards and punishments from the environment. Most RL methods optimize the discoun...
Prasad Tadepalli, DoKyeong Ok