2294 search results - page 256 / 459 » From Path Graphs to Directed Path Graphs |
122
click to vote
TAP
2008
Springer
15 years 3 months ago
2008
Springer
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
140
click to vote
FUZZIEEE
2007
IEEE
15 years 9 months ago
2007
IEEE
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...
126
click to vote
PODC
2004
ACM
15 years 8 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
128
click to vote
SIGCOMM
2004
ACM
15 years 8 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
184
Voted
IJCAI
1989
15 years 4 months ago
1989
Heuristic search procedures are useful in a large number of problems of practical importance. Such procedures operate by searching several paths in a search space at the same time...