1172 search results - page 99 / 235 » Path Algorithms on Regular Graphs |
129
click to vote
KDD
2004
ACM
15 years 5 months ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
ICDE
2010
IEEE
16 years 8 days ago
2010
IEEE
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
125
click to vote
SIGMETRICS
2005
ACM
15 years 6 months ago
2005
ACM
The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing t...
119
click to vote
PLDI
2011
ACM
14 years 3 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
109
Voted
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...