Sciweavers

177 search results - page 16 / 36
» Learning complex problem solving expertise from failures
Sort
View
AAAI
2007
13 years 10 months ago
Temporal Difference and Policy Search Methods for Reinforcement Learning: An Empirical Comparison
Reinforcement learning (RL) methods have become popular in recent years because of their ability to solve complex tasks with minimal feedback. Both genetic algorithms (GAs) and te...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
CEC
2005
IEEE
13 years 9 months ago
Co-evolutionary modular neural networks for automatic problem decomposition
Abstract- Decomposing a complex computational problem into sub-problems, which are computationally simpler to solve individually and which can be combined to produce a solution to ...
Vineet R. Khare, Xin Yao, Bernhard Sendhoff, Yaoch...
ML
2006
ACM
13 years 7 months ago
Relational IBL in classical music
It is well known that many hard tasks considered in machine learning and data mining can be solved in a rather simple and robust way with an instanceand distance-based approach. In...
Asmir Tobudic, Gerhard Widmer
CPAIOR
2007
Springer
14 years 1 months ago
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
Wafa Karoui, Marie-José Huguet, Pierre Lope...
CVPR
2011
IEEE
13 years 3 months ago
Learning Temporally Consistent Rigidities
We present a novel probabilistic framework for rigid tracking and segmentation of shapes observed from multiple cameras. Most existing methods have focused on solving each of thes...
Jean-Sebastien Franco, Edmond Boyer