Sciweavers

4759 search results - page 748 / 952
» Parallelizing the Phylogeny Problem
Sort
View
JPDC
2007
138views more  JPDC 2007»
15 years 6 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
AROBOTS
2004
119views more  AROBOTS 2004»
15 years 6 months ago
Swarm-Bot: A New Distributed Robotic Concept
The swarm intelligence paradigm has proven to have very interesting properties such as robustness, flexibility and ability to solve complex problems exploiting parallelism and self...
Francesco Mondada, Giovanni C. Pettinaro, Andr&eac...
COMCOM
2000
85views more  COMCOM 2000»
15 years 6 months ago
Interactive Distributed Multimedia Systems and Telecommunication Services
As the popularity of the World Wide Web increases, the amount of traffic results in major congestion problems for the retrieval of data over wide distances. To react to this, user...
ENTCS
2000
97views more  ENTCS 2000»
15 years 6 months ago
Complexity of Weak Bisimilarity and Regularity for BPA and BPP
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
Jirí Srba
GPEM
2002
163views more  GPEM 2002»
15 years 6 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf