14548 search results - page 2428 / 2910 » The Optimal Path-Matching Problem |
184
Voted
ICONIP
1998
15 years 9 months ago
1998
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
221
click to vote
AAAI
1993
15 years 9 months ago
1993
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...
200
Voted
SODA
1996
ACM
15 years 9 months ago
1996
ACM
We consider the problem faced by a mobile robot that has to reach a given target by traveling through an unmapped region in the plane containing oriented rectangular obstacles. We...
203
click to vote
WCE
2007
15 years 8 months ago
2007
—A dramatic and continuous increase in the complexity and size of websites on the Internet makes rather difficult to build such websites with required information to be easily fo...
201
click to vote
CSL
2010
Springer
15 years 8 months ago
2010
Springer
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...