Sciweavers

365 search results - page 44 / 73
» Reconfigurations in Graphs and Grids
Sort
View
JEA
2010
95views more  JEA 2010»
13 years 9 months ago
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
In recent years, highly effective hierarchical and goal-directed speedup techniques for routing in large road networks have been developed. This paper makes a systematic study of ...
Reinhard Bauer, Daniel Delling, Peter Sanders, Den...
SPAA
1990
ACM
14 years 3 months ago
Low Overhead Parallel Schedules for Task Graphs
d Abstract) Richard J. Anderson Paul Beame Walter L. Ruzzo Department of Computer Science and Engineering University of Washingtoni We introduce a task scheduling model which is u...
Richard J. Anderson, Paul Beame, Walter L. Ruzzo
FGCS
2007
160views more  FGCS 2007»
13 years 11 months ago
Distributed data mining in grid computing environments
The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an e...
Ping Luo, Kevin Lü, Zhongzhi Shi, Qing He
ENDM
2006
70views more  ENDM 2006»
13 years 11 months ago
Quasirandomness in Graphs
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
Benjamin Doerr, Tobias Friedrich
CONEXT
2010
ACM
13 years 9 months ago
Assessing the vulnerability of replicated network services
Client-server networks are pervasive, fundamental, and include such key networks as the Internet, power grids, and road networks. In a client-server network, clients obtain a serv...
George Dean Bissias, Brian Neil Levine, Ramesh K. ...