Search Sciweavers | Sciweavers

27354 search results - page 401 / 5471

» Distributed And Parallel Computing

168

click to vote

SPAA
1992
ACM

88views Distributed And Parallel Com...» more SPAA 1992»

Separator Based Parallel Divide and Conquer in Computational Geometry

15 years 11 months ago

Download www.math.cmu.edu

An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...

Alan M. Frieze, Gary L. Miller, Shang-Hua Teng

claim paper

Read More »

153

click to vote

SPAA
1993
ACM

134views Distributed And Parallel Com...» more SPAA 1993»

On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random Sampling

15 years 11 months ago

Download www.cs.brown.edu

We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.

Philip N. Klein

claim paper

Read More »

168

click to vote

HPCN
2000
Springer

110views Distributed And Parallel Com...» more HPCN 2000»

A Service-Based Agent Framework for Distributed Symbolic Computation

15 years 10 months ago

Download www.carstensinz.de

We present OKEANOS, a distributed service-based agent framework implemented in Java, in which agents can act autonomously and make use of stationary services. Each agent's beh...

Ralf-Dieter Schimkat, Wolfgang Blochinger, Carsten...

claim paper

Read More »

136

click to vote

PVM
2005
Springer

195views Distributed And Parallel Com...» more PVM 2005»

Hint Controlled Distribution with Parallel File Systems

16 years 9 days ago