241 search results - page 4 / 49 » Four Paths to AI |
STOC
1992
ACM
13 years 11 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
AI
2006
Springer
13 years 7 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
AI
2008
Springer
13 years 7 months ago
2008
Springer
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...
IPL
2008
13 years 7 months ago
2008
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
ICRA
1993
IEEE
13 years 11 months ago
1993
IEEE
Navigationalpath planning is a classicalproblem in autonomous mobile robotics. Most AI approachesto path planning use goal-directedheuristicsearch of problem spaces defined by spa...