Sciweavers

115 search results - page 18 / 23
» Time and the Prisoner's Dilemma
Sort
View
IJCAI
2001
14 years 11 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
DIGRA
2005
Springer
15 years 3 months ago
Law, order and conflicts of interest in massively multiplayer online games
In huge online games where great numbers of players can be connected at the same time, social interaction is complex and conflicts become part of everyday life. There is a set of ...
Daniel Pargman, Andreas Eriksson
ISVLSI
2003
IEEE
97views VLSI» more  ISVLSI 2003»
15 years 3 months ago
Q-Tree: A New Iterative Improvement Approach for Buffered Interconnect Optimization
The “chicken-egg” dilemma between VLSI interconnect timing optimization and delay calculation suggests an iterative approach. We separate interconnect timing transformation as...
Andrew B. Kahng, Bao Liu
ICANN
2005
Springer
15 years 3 months ago
A Neural Network Model for Inter-problem Adaptive Online Time Allocation
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...
Matteo Gagliolo, Jürgen Schmidhuber
ATMOS
2008
124views Optimization» more  ATMOS 2008»
14 years 11 months ago
Simultaneous Network Line Planning and Traffic Assignment
One of the basic problems in strategic planning of public and rail transport is the line planning problem to find a system of lines and its associated frequencies. The objectives o...
Karl Nachtigall, Karl Jerosch