Filters








8,603 Hits in 4.0 sec

Efficient massively parallel implementation of some combinatorial algorithms

Tsan-sheng Hsu, Vijaya Ramachandran
<span title="">1996</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
We describe our implementation of several efficient parallel algorithms on the massively parallel SIMD machine MasPar MP-1 with virtual processing.  ...  In this paper, we describe the implementation of virtual processing for several combinatorial algorithms using the MPL language.  ...  Introduction This paper describes an ongoing project for implementing parallel algorithms on the massively parallel single-instruction-multiple-data (SIMD) machine MasPar MP-1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(96)00034-5">doi:10.1016/0304-3975(96)00034-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wwcq2n2s5bcs7ldaoqsu66geku">fatcat:wwcq2n2s5bcs7ldaoqsu66geku</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190228151002/https://core.ac.uk/download/pdf/82481752.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/20/43/2043dcc143b88b2d1f8e000a6db1aa9440800b06.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0304-3975(96)00034-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

The Combinatorial BLAS: design, implementation, and applications

Aydın Buluç, John R Gilbert
<span title="2011-05-19">2011</span> <i title="SAGE Publications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/prmoui3bz5a2jktzh4pt7dtery" style="color: black;">The international journal of high performance computing applications</a> </i> &nbsp;
We describe the Parallel Combinatorial BLAS, which consists of a small but powerful set of linear algebra primitives specifically targeting graph and data mining applications.  ...  The library is evaluated using two important graph algorithms, in terms of both performance and ease-ofuse.  ...  Some existing primitives can be used to implement a number of graph algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1177/1094342011403516">doi:10.1177/1094342011403516</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hyplcu2f2vco3oj4fv3e3hdevq">fatcat:hyplcu2f2vco3oj4fv3e3hdevq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110401104019/http://www.cs.ucsb.edu/research/tech_reports/reports/2010-18.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c7/f8/c7f82b511ef5bb5c87f8d057e022fe3bd812fcdc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1177/1094342011403516"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> sagepub.com </button> </a>

Graph Analysis with High-Performance Computing

Bruce Hendrickson, Jonathan W. Berry
<span title="">2008</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4hwwgwyqabardl76zzbexzcmhu" style="color: black;">Computing in science &amp; engineering (Print)</a> </i> &nbsp;
To study such data sets, the authors explored the use of highperformance computing (HPC) for graph algorithms.  ...  They found that the challenges in these applications are quite different from those arising in traditional HPC applications and that massively multithreaded machines are well suited for graph problems.  ...  parallel graph implementations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mcse.2008.56">doi:10.1109/mcse.2008.56</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vucz73s6x5h35ehhikxpbzlynq">fatcat:vucz73s6x5h35ehhikxpbzlynq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130819090359/http://www.cs.ucsb.edu/~gilbert/cs140/notes/HendricksonBerry.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d6/ad/d6ad73a553edb35e82f3c89ef26265d8fe5b272f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mcse.2008.56"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Programming Model to Develop Supercomputer Combinatorial Solvers

Ghaith Tarawneh, Andrey Mokhov, Matthew Naylor, Alex Rast, Simon W. Moore, David B. Thomas, Alex Yakovlev, Andrew Brown
<span title="">2017</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2564w2ohnjhfjl4wklbpdzzwtq" style="color: black;">2017 46th International Conference on Parallel Processing Workshops (ICPPW)</a> </i> &nbsp;
We present a multi-layer software abstraction model to develop combinatorial solvers on massively-parallel machines with regular topologies.  ...  Abstract-Novel architectures for massively parallel machines offer better scalability and the prospect of achieving linear speedup for sizable problems in many domains.  ...  INTRODUCTION Modern massively parallel machines can now support millions of cores [1] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icppw.2017.35">doi:10.1109/icppw.2017.35</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icppw/TarawnehMNRMTYB17.html">dblp:conf/icppw/TarawnehMNRMTYB17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5k5w4nb4ajgkhgiyamlumqsibe">fatcat:5k5w4nb4ajgkhgiyamlumqsibe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200311042825/https://eprint.ncl.ac.uk/file_store/production/242060/B4BD59FA-1F3B-49FE-B9E0-34B0AA8E386A.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ac/3a/ac3a07868cbef25b27dec80ff86607be121693e0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icppw.2017.35"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

7. Combinatorial Parallel and Scientific Computing [chapter]

Ali Pınar, Bruce Hendrickson
<span title="">2006</span> <i title="Society for Industrial and Applied Mathematics"> Parallel Processing for Scientific Computing </i> &nbsp;
Combinatorial algorithms have long played a pivotal enabling role in many applications of parallel computing.  ...  This chapter will describe some of the many areas of intersection between  ...  [19] worked on an efficient parallel implementation of this algorithm and applied it to radiation transport problems.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/1.9780898718133.ch7">doi:10.1137/1.9780898718133.ch7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/szr5t7calne2fbhkbkvwccrj6y">fatcat:szr5t7calne2fbhkbkvwccrj6y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829235923/http://www.sandia.gov/~apinar/papers/Siambook.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/96/03/9603acc0fe130b96a8d5045ab8287bc356062ffb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/1.9780898718133.ch7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Algorithm engineering

Giuseppe Cattaneo, Giuseppe Italiano
<span title="1999-09-01">1999</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/eiea26iqqjcatatlgxdpzt637y" style="color: black;">ACM Computing Surveys</a> </i> &nbsp;
a de facto standard in the implementation of discrete and combinatorial algorithms.  ...  In this section, we will briefly describe some of the main tools and techniques developed in two paradigmatic areas: algorithms on massive data sets, and numerically stable algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/333580.333582">doi:10.1145/333580.333582</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h4hmccvorrfzjc3yrntctvelqi">fatcat:h4hmccvorrfzjc3yrntctvelqi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060824190936/http://ce.sharif.ac.ir:80/~ghodsi/archive/downloaded-papers/ACM%20Computing%20Surveys/Algorithm%20Engineering.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/49/f7/49f74200dc738c05183176e56821c63d6014d301.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/333580.333582"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Learning hardware using multiple-valued logic - Part 1: introduction and approach

M. Perkowski, D. Foote, Qihong Chen, A. Al-Rabadi, L. Jozwiak
<span title="">2002</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/gvjkwgwwvnakpbfssxpqjozbqm" style="color: black;">IEEE Micro</a> </i> &nbsp;
Building intelligent robots will ultimately require developing real-time hardware realizations of exact or high-quality approximate algorithms for NP combinatorial problems.  ...  However, in test generation 1 and combinatorial optimization areas, reconfigurable, field-programmable-gate-array (FPGA)-based processors can solve some nondeterministic polynomial time (NP)-hard problems  ...  C CMs present opportunities for implementing massively parallel structures with reprogrammable FPGAs, which leads to a high degree of flexibility.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mm.2002.1013303">doi:10.1109/mm.2002.1013303</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fjeo52iks5hafg5gcuz53h7sxy">fatcat:fjeo52iks5hafg5gcuz53h7sxy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830074705/http://web.cecs.pdx.edu/~mperkows/=PUBLICATIONS/Perkowski/K2002/Perkowski_Learning-HW-1_IEEEMicro2002.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/21/ed/21ed2fb8b64ed64d60f30f5e6b4a2b3db39a1aa1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/mm.2002.1013303"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP [chapter]

P. M. Pardalos, L. Pitsoulis, T. Mavridou, M. G. C. Resende
<span title="">1995</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Recent developments on parallel implementation of genetic algorithms, simulated annealing, tabu search, and greedy randomized adaptive search procedures (GRASP) are discussed. 3 Etymologically the word  ...  In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems.  ...  Most recently, Boissin and Lutton [6] proposed a new SA algorithm that can be efficiently implemented on a massively parallel computer.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-60321-2_26">doi:10.1007/3-540-60321-2_26</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wqgpslp6b5cfzpu7dnvgyw7oha">fatcat:wqgpslp6b5cfzpu7dnvgyw7oha</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081031174118/http://www.research.att.com/~mgcr/doc/gqaps-parallel.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/82/f8/82f854446590101ce5ba01973bd4bdbbd3b717df.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-60321-2_26"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Massively parallel computing and the search for jets and black holes at the LHC

V. Halyo, P. LeGresley, P. Lujan
<span title="">2014</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wlymb735mjbbhbp4jd3xjlbbhy" style="color: black;">Nuclear Instruments and Methods in Physics Research Section A : Accelerators, Spectrometers, Detectors and Associated Equipment</a> </i> &nbsp;
Massively parallel computing at the LHC could be the next leap necessary to reach an era of new discoveries at the LHC after the Higgs discovery.  ...  This cutting edge technology provides not only the means to accelerate existing algorithms, but also the opportunity to develop new algorithms that select events in the trigger that previously would have  ...  Hough Transform Algorithm As a demonstration of how computationally intensive 2D tracking algorithms can take advantage of massively parallel GPU processing, the authors developed an implementation of  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.nima.2014.01.038">doi:10.1016/j.nima.2014.01.038</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h62lzqcoofefzakhpkbcchatim">fatcat:h62lzqcoofefzakhpkbcchatim</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030072923/http://cds.cern.ch/record/1603000/files/arXiv:1309.6275.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ee/96/ee9614a33ba3eedb78cdf6a5704feb24993a9677.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.nima.2014.01.038"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Brief Announcement: Massively Parallel Approximate Distance Sketches

Michael Dinitz, Yasamin Nazari, Michael Wagner
<span title="2019-10-11">2019</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2pcluxp32rfojgwekdrryxoaqu" style="color: black;">International Symposium on Distributed Computing</a> </i> &nbsp;
We initiate their study in newer (and arguably more realistic) models of distributed computation: the Congested Clique model and the Massively Parallel Computation (MPC) model.  ...  Along the way, we show that other useful combinatorial structures can also be computed in MPC. In particular, one key component we use is an MPC construction of the hopsets of [2] .  ...  Our main focus is the Massively Parallel Computation, or MPC model.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.disc.2019.42">doi:10.4230/lipics.disc.2019.42</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wdag/DinitzN19.html">dblp:conf/wdag/DinitzN19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3xjwtruhrvfbllwl5lwflt4pcu">fatcat:3xjwtruhrvfbllwl5lwflt4pcu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220307212135/https://drops.dagstuhl.de/opus/volltexte/2019/11349/pdf/LIPIcs-DISC-2019-42.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ec/4a/ec4acb76d26a78511ebe001e8c453445134960a4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.disc.2019.42"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology [chapter]

David A. Bader
<span title="">2005</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We describe our novel methodology for designing and implementing irregular parallel algorithms that attain significant performance on high-end computer systems.  ...  , cache-aware programming, careful performance tuning, and massive parallelism.  ...  Experimental Parallel Algorithms We discuss our design and implementation of theoretically-efficient parallel algorithms for combinatorial (irregular) problems that deliver significant speedups on typical  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11427186_3">doi:10.1007/11427186_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3bwy4zp3f5dgdonrjt2mi5opom">fatcat:3bwy4zp3f5dgdonrjt2mi5opom</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081031231842/http://www.cc.gatech.edu/~bader/papers/WEA2005-CompBio.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ad/6c/ad6ce0d4d4f90c86e011d30c757ae8a0596e8bd9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11427186_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A parallel ant colony algorithm on massively parallel processors and its convergence analysis for the travelling salesman problem

Ling Chen, Hai-Ying Sun, Shu Wang
<span title="">2012</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ozlq63ehnjeqxf6cuxxn27cqra" style="color: black;">Information Sciences</a> </i> &nbsp;
An adaptive parallel ant colony optimisation (PACO) algorithm on massively parallel processors (MPPs) is presented.  ...  Experimental results of the TSP confirm our theoretical conclusions and show that our PACO algorithm has a high convergence speed, high speedup and high efficiency.  ...  Massively parallel processors Our parallel ant colony algorithm is based on the computational model of massively parallel processors (MPPs), which adopt the message-passing method.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ins.2012.02.055">doi:10.1016/j.ins.2012.02.055</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ezf56zn7pbhcpe5jqpopvx2f5i">fatcat:ezf56zn7pbhcpe5jqpopvx2f5i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813090316/http://isiarticles.com/bundles/Article/pre/pdf/7791.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7c/dc/7cdc278095466fe03e2e249dd89264807b382b05.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ins.2012.02.055"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Towards hybrid evolutionary algorithms

P. Preux, E.-G. Talbi
<span title="">1999</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2vyq3vorabczbc57sgxyrmy42y" style="color: black;">International Transactions in Operational Research</a> </i> &nbsp;
In order to add some rational to these issues, we study the structure of search spaces and attempt to relate it to the performance of algorithms.  ...  However, the choice of a particular algorithm to optimize a certain problem is still mainly driven by some sort of devotion of its author to a certain technique rather than by a rationalistic choice driven  ...  Parallel implementation of functional heterogeneous PAH algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1111/j.1475-3995.1999.tb00173.x">doi:10.1111/j.1475-3995.1999.tb00173.x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/axqcpomtujcx5fd23rsnwqo54m">fatcat:axqcpomtujcx5fd23rsnwqo54m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050511172205/http://www.grappa.univ-lille3.fr:80/~ppreux/papiers/itor.draft.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/54/29/542946b6cf54b09a6ff14f2ff7ed259640e0e416.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1111/j.1475-3995.1999.tb00173.x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Towards hybrid evolutionary algorithms

P Preux
<span title="">1999</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2vyq3vorabczbc57sgxyrmy42y" style="color: black;">International Transactions in Operational Research</a> </i> &nbsp;
In order to add some rational to these issues, we study the structure of search spaces and attempt to relate it to the performance of algorithms.  ...  However, the choice of a particular algorithm to optimize a certain problem is still mainly driven by some sort of devotion of its author to a certain technique rather than by a rationalistic choice driven  ...  Parallel implementation of functional heterogeneous PAH algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0969-6016(99)00019-2">doi:10.1016/s0969-6016(99)00019-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cr525zd6hvgg3gfe55642t5jsi">fatcat:cr525zd6hvgg3gfe55642t5jsi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20050511172205/http://www.grappa.univ-lille3.fr:80/~ppreux/papiers/itor.draft.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/54/29/542946b6cf54b09a6ff14f2ff7ed259640e0e416.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0969-6016(99)00019-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Parallel Constraint-Based Local Search on the Cell/BE Multicore Architecture [chapter]

Daniel Diaz, Salvador Abreu, Philippe Codognet
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/oqt3yqhkxvcubnonwg57er4tdq" style="color: black;">Studies in Computational Intelligence</a> </i> &nbsp;
We present a parallel version of a constraintbased Local Search algorithm which was chosen because it fits very well the Cell/BE architecture since it requires neither shared memory nor communication between  ...  We investigate the use of the Cell Broadband Engine (Cell/BE) for Combinatorial Optimization applications.  ...  Acknowledgements The equipment used in this work was provided as a grant from the IBM Corporation Shared University Research (SUR) program awarded to CENTRIA and U. of  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-15211-5_28">doi:10.1007/978-3-642-15211-5_28</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ozrh6c4mhfbotiw5qy5j32iqqi">fatcat:ozrh6c4mhfbotiw5qy5j32iqqi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808080110/http://cri-dist.univ-paris1.fr/diaz/publications/ADAPTIVE/idc10.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f4/68/f468419da9e692c82d89e30440afe2c89687c7c4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-15211-5_28"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 8,603 results