434 search results - page 34 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
106
Voted
ICALP
2009
Springer
16 years 1 days ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
AIPS
2010
15 years 2 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
183
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
108
click to vote
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
SDM
2007
SIAM
15 years 1 months ago
2007
SIAM
The problem of combining the ranked preferences of many experts is an old and surprisingly deep problem that has gained renewed importance in many machine learning, data mining, a...