Sciweavers

8 search results - page 1 / 2
» On Dynamic Breadth-First Search in External-Memory
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 9 months ago
On Dynamic Breadth-First Search in External-Memory
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monot...
Ulrich Meyer
ICALP
1999
Springer
14 years 1 months ago
Online Data Structures in External Memory
The data sets for many of today's computer applications are too large to t within the computer's internal memory and must instead be stored on external storage devices su...
Jeffrey Scott Vitter
GLOBECOM
2006
IEEE
14 years 3 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
13 years 10 months ago
Dynamic optimality for skip lists and B-trees
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...
CEC
2010
IEEE
13 years 10 months ago
Dynamic multi-swarm particle swarm optimizer with sub-regional harmony search
In this paper, the dynamic multi-swarm particle swarm optimizer (DMS-PSO) and a sub-regional harmony search (SHS) are hybridized to obtain DMS-PSO-SHS. A Modified multi-trajectory ...
Shi-Zheng Zhao, Ponnuthurai Nagaratnam Suganthan, ...