Sciweavers

987 search results - page 151 / 198
» Asynchronous parallel search by the parallel genetic algorit...
Sort
View
LCPC
1997
Springer
14 years 1 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
PODC
2011
ACM
12 years 12 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
EC
2000
187views ECommerce» more  EC 2000»
13 years 9 months ago
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function i...
Eckart Zitzler, Kalyanmoy Deb, Lothar Thiele
ICS
2010
Tsinghua U.
14 years 6 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
ERSA
2010
137views Hardware» more  ERSA 2010»
13 years 6 months ago
An Automated Scheduling and Partitioning Algorithm for Scalable Reconfigurable Computing Systems
As reconfigurable computing (RC) platforms are becoming increasingly large-scale and heterogeneous, efficiently scheduling and partitioning applications on these platforms is a gro...
Casey Reardon, Alan D. George, Greg Stitt, Herman ...