Sciweavers

3628 search results - page 349 / 726
» The Decision Diffie-Hellman Problem
Sort
View
NIPS
2000
15 years 8 months ago
Using Free Energies to Represent Q-values in a Multiagent Reinforcement Learning Task
The problem of reinforcement learning in large factored Markov decision processes is explored. The Q-value of a state-action pair is approximated by the free energy of a product o...
Brian Sallans, Geoffrey E. Hinton
WSC
2000
15 years 8 months ago
Using simulation for manufacturing process reengineering: a practical case study
This paper presents a simulation study carried out to solve a problem of manufacturing process reengineering. The specific company in which the study took place is a medium size m...
Lisete Silva, Ana Luisa Ramos, Pedro M. Vilarinho
AIEDAM
2008
127views more  AIEDAM 2008»
15 years 6 months ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
AUTOMATICA
2008
74views more  AUTOMATICA 2008»
15 years 6 months ago
Policy iteration based feedback control
It is well known that stochastic control systems can be viewed as Markov decision processes (MDPs) with continuous state spaces. In this paper, we propose to apply the policy iter...
Kan-Jian Zhang, Yan-Kai Xu, Xi Chen, Xi-Ren Cao
187
Voted
CORR
2010
Springer
95views Education» more  CORR 2010»
15 years 6 months ago
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
Frédérique Bassino, Mathilde Bouvel,...