4679 search results - page 387 / 936 » Modeling When Connections Are the Problem |
178
click to vote
IJCAI
2003
15 years 8 months ago
2003
We present a new algorithm, GM-Sarsa(0), for finding approximate solutions to multiple-goal reinforcement learning problems that are modeled as composite Markov decision processe...
189
click to vote
AAAI
2000
15 years 8 months ago
2000
This paper addresses the problem of tracking and diagnosing complex systems with mixtures of discrete and continuous variables. This problem is a difficult one, particularly when ...
159
click to vote
WSC
1998
15 years 8 months ago
1998
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
184
click to vote
ACTA
2010
15 years 6 months ago
2010
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The paper studies the visibility maintenance problem (VMP) for a leader-follower pair of robots modelled as first-order dynamic systems and proposes an original solution based on t...