1614 search results - page 9 / 323 » Breadth-First Heuristic Search |
CADE
2004
Springer
14 years 8 months ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...