Sciweavers

3678 search results - page 589 / 736
» On the Stable Paths Problem
Sort
View
AAAI
1993
15 years 5 months ago
Complexity Analysis of Real-Time Reinforcement Learning
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
Sven Koenig, Reid G. Simmons
AAAI
1994
15 years 5 months ago
Learning to Coordinate without Sharing Information
Researchers in the eld of Distributed Arti cial Intelligence (DAI) have been developing e cient mechanisms to coordinate the activities of multiple autonomous agents. The need for...
Sandip Sen, Mahendra Sekaran, John Hale
DAGSTUHL
1990
15 years 5 months ago
Parallel Rule-Firing Production Systems
One of the principal advantages of parallelizing a rule-based system, or more generally, any A.I. system, is the ability to pursue alternate search paths concurrently. Conventiona...
Daniel Neimann
CONCUR
2010
Springer
15 years 5 months ago
Mean-Payoff Automaton Expressions
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
Krishnendu Chatterjee, Laurent Doyen, Herbert Edel...
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
15 years 5 months ago
Enhanced generalized ant programming (EGAP)
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
Amirali Salehi-Abari, Tony White