Sciweavers

175 search results - page 22 / 35
» Forgetting Reinforced Cases
Sort
View
ATAL
2008
Springer
13 years 9 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...
ANOR
2011
101views more  ANOR 2011»
13 years 2 months ago
The case for strategic oscillation
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...
Fred Glover, Jin-Kao Hao
CORR
2006
Springer
140views Education» more  CORR 2006»
13 years 7 months ago
Nearly optimal exploration-exploitation decision thresholds
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
Christos Dimitrakakis
EVOW
2009
Springer
14 years 2 months ago
A Critical Element-Guided Perturbation Strategy for Iterated Local Search
In this paper, we study the perturbation operator of Iterated Local Search. To guide more efficiently the search to move towards new promising regions of the search space, we intro...
Zhipeng Lü, Jin-Kao Hao
ICALT
2005
IEEE
14 years 1 months ago
Can Collaborative Technologies Improve Management Education?
This paper explores the potential impact of collaborative technologies on improving management education. The first goal is to expose students to tools and practices that not only...
Marie-Noëlle Bessagnet, Lee Schlenker, Robert...