Sciweavers

543 search results - page 13 / 109
» A Randomized Parallel Sorting Algorithm with an Experimental...
Sort
View
ICDCS
2007
IEEE
14 years 1 months ago
Distributed Slicing in Dynamic Systems
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
Antonio Fernández, Vincent Gramoli, Ernesto...
PPL
2008
124views more  PPL 2008»
13 years 7 months ago
Experimental Evaluation of BSP Programming Libraries
The model of bulk-synchronous parallel computation (BSP) helps to implement portable general purpose algorithms while keeping predictable performance on different parallel compute...
Peter Krusche
PVLDB
2008
90views more  PVLDB 2008»
13 years 7 months ago
Sorting hierarchical data in external memory for archiving
Sorting hierarchical data in external memory is necessary for a wide variety of applications including archiving scientific data and dealing with large XML datasets. The topic of ...
Ioannis Koltsidas, Heiko Müller, Stratis Vigl...
AI
2002
Springer
13 years 7 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 7 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...