1172 search results - page 175 / 235 » Path Algorithms on Regular Graphs |
138
click to vote
TACAS
2010
Springer
14 years 11 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
111
click to vote
SIROCCO
2010
15 years 3 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
106
click to vote
ICRA
2009
IEEE
15 years 8 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
106
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
124
click to vote
ICTAI
2000
IEEE
15 years 5 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...