Sciweavers

5653 search results - page 203 / 1131
» Distributed Conceptual Structures
Sort
View
ICGA
1993
75views Optimization» more  ICGA 1993»
15 years 7 months ago
Structure and Performance of Fine-Grain Parallelism in Genetic Search
Within the parallel genetic algorithm framework, there currently exists a growing dichotomy between coarse-pain and fine-grain parallel architectures. This paper attempts to chara...
Shumeet Baluja
WDAG
2010
Springer
185views Algorithms» more  WDAG 2010»
15 years 4 months ago
The Computational Structure of Progress Conditions
Abstract. Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n...
Gadi Taubenfeld
SODA
2012
ACM
268views Algorithms» more  SODA 2012»
13 years 9 months ago
Analyzing graph structure via linear measurements
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...
Kook Jin Ahn, Sudipto Guha, Andrew McGregor
CLUSTER
2006
IEEE
15 years 6 months ago
Optimizing MPI collective communication by orthogonal structures
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
CCS
2010
ACM
15 years 6 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov