2796 search results - page 417 / 560 » The coolest path problem |
214
click to vote
CONSTRAINTS
1998
15 years 6 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
197
click to vote
ASUNAM
2011
IEEE
14 years 6 months ago
2011
IEEE
—The problem of predicting links or interactions between objects in a network, is an important task in network analysis. Along this line, link prediction between co-authors in a ...
164
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Recent work has led to the development of an elegant theory of Linearly Solvable Markov Decision Processes (LMDPs) and related Path-Integral Control Problems. Traditionally, LMDPs...
179
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding...
149
click to vote
CCCG
2010
15 years 7 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...