353 search results - page 31 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
156
Voted
PUK
2003
15 years 4 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
120
Voted
OTM
2010
Springer
15 years 18 days ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
119
Voted
COSIT
1995
Springer
15 years 6 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
103
Voted
ICTAI
2005
IEEE
15 years 8 months ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
132
Voted
SODA
1998
ACM
15 years 4 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...