Sciweavers

394 search results - page 26 / 79
» A Study of Empirical Learning for an Involved Problem
Sort
View
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
15 years 3 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
ML
2006
ACM
113views Machine Learning» more  ML 2006»
14 years 11 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
AIMSA
2004
Springer
15 years 3 months ago
Towards Well-Defined Multi-agent Reinforcement Learning
Multi-agent reinforcement learning (MARL) is an emerging area of research. However, it lacks two important elements: a coherent view on MARL, and a well-defined problem objective. ...
Rinat Khoussainov
AIED
2005
Springer
15 years 5 months ago
The role of learning goals in the design of ILEs: Some issues to consider
Part of the motivation behind the evolution of learning environments is the idea of providing students with individualized instructional strategies that allow them to learn as much...
Erika Martínez-Mirón, Amanda Harris,...
ICML
2006
IEEE
16 years 17 days ago
Pareto optimal linear classification
We consider the problem of choosing a linear classifier that minimizes misclassification probabilities in two-class classification, which is a bi-criterion problem, involving a tr...
Seung-Jean Kim, Alessandro Magnani, Sikandar Samar...