Filters








650,786 Hits in 8.1 sec

Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations

S. G. Akl
1987 Computer journal  
Three new adaptive and cost-optimal parallel algorithms are described for the problems of enumerating permutations and combinations ofm out ofn objects.  ...  It runs in O(\nl/k]-n) time for an optimal cost of  ...  Acknowledgement The author wishes to thank an anonymous referee for a number of instructive comments.  ... 
doi:10.1093/comjnl/30.5.433 fatcat:ik6mv2bl5raxjde5tkhmgmcz5a

A Parallel Algorithm for Matheuristics: A Comparison of Optimization Solvers

Martín González, Jose J. López-Espín, Juan Aparicio
2020 Electronics  
In this paper, a hybrid parallel optimization algorithm for matheuristics is studied.  ...  The algorithm proposed follows an efficient decomposition which is based on the nature of the decision variables (continuous versus discrete).  ...  Acknowledgments: The authors are grateful for the financial support from the Santander Chair of Efficiency and Productivity of the University Miguel Hernandez of Elche (Spain).  ... 
doi:10.3390/electronics9091541 doaj:32a43e785c434715b5aa6d972c686925 fatcat:cfdobwkqebgfxbos3zpm6adp6i

Architectural Optimization of Parallel Authenticated Encryption Algorithm for Satellite Application

Syed Jahanzeb Hussain Pirzada, Abid Murtaza, Tongge Xu, Liu Jianwei
2020 IEEE Access  
The optimization of the proposed algorithm and security analysis is presented for space application using different optimizations and a combination of optimizations.  ...  The AE algorithms are available with serial and parallel architectures; among them, the Galois Counter Mode (GCM) algorithm has a parallel architecture.  ...  The parallel optimization can pre-compute the keys and IVs using combinational logic for saving these few clock cycles.  ... 
doi:10.1109/access.2020.2978665 fatcat:brtrg4e6wzghpcm7z3v73kysj4

Parallel surrogate-assisted global optimization with expensive functions – a survey

Raphael T. Haftka, Diane Villanueva, Anirban Chaudhuri
2016 Structural And Multidisciplinary Optimization  
In addition to optimization based on adaptive sampling, surrogate assisted parallel evolutionary algorithms are also surveyed.  ...  These allow sophisticated approaches for balancing exploration and exploitation and even allow to develop algorithms with calculable rate of convergence as function of the number of parallel processors  ...  For an extensive review of nature-inspired global optimization algorithms the reader is referred to Yang (2010) .  ... 
doi:10.1007/s00158-016-1432-3 fatcat:p6gewbd5o5dfpcmciznpnqm7am

Application of Multi-Core Parallel Programming to a Combination of Ant Colony Optimization and Genetic Algorithm

Rishita Kalyani
2015 Indian Journal of Science and Technology  
This Paper will deal with a combination of Ant Colony and Genetic Programming Algorithm to optimize Travelling Salesmen problem (NP-Hard).  ...  to the combination of algorithm is achieved by OpenMP library by Intel Corporation.  ...  by graph 1 distance(i, j) Application of Multi-Core Parallel Programming to a Combination of Ant Colony Optimization and Genetic Algorithm while (condition !  ... 
doi:10.17485/ijst/2015/v8is2/59091 fatcat:smnhjy6zevbbfmad3d2v7vbj4q

Page 1643 of Mathematical Reviews Vol. , Issue 94c [page]

1994 Mathematical Reviews  
Stojmenovic¢, Ivan (3-OTTW-C; Ottawa, ON) A simple optimal systolic algorithm for generating permutations.  ...  Summary: “A systolic algorithm is described for generating, in lexicographically ascending order, all combinations of m objects chosen from an arbitrary set of n elements.  ... 

Significance of parallel computing on the performance of Digital Image Correlation algorithms in MATLAB [article]

Andreas Thoma, Sridhar Ravi
2019 arXiv   pre-print
Finally, irrespective of the computing mode the correct choice of combinations of integer-pixel and sub-pixel search algorithms is decisive for an efficient analysis.  ...  The Newton-Raphson algorithm in combination with a modified Particle Swarm algorithm in parallel image computation was found to be most effective.  ...  Through iteration with different generations "t" of particle "i" an optimal solution is found.  ... 
arXiv:1905.06228v1 fatcat:xbkgrql7avd2fpkrqbafmb3dua

Parallel Hybrid Metaheuristics [chapter]

Carlos Cotta, El-Ghazali Talbi, Enrique Alba
2005 Parallel Metaheuristics  
Finding optimal solutions is in general computationally intractable for many combinatorial optimization problems, e.g., those known as NP-hard [54] .  ...  whole success are thus swiftly coming to an end.  ...  In such a combination, the former algorithms will try to optimize locally, while the population-based algorithms will try to optimize globally.  ... 
doi:10.1002/0471739383.ch15 fatcat:frvcocssmbalbgx6lwnjbj3npu

Automatic design optimization using parallel workflows

David Abramson, Blair Bethwaite, Colin Enticott, Slavisa Garic, Tom Peachey, Anushka Michailova, Saleh Amirriazi
2010 Procedia Computer Science  
We implement a range of generic actors for an existing workflow system called Kepler, and discuss how they can be combined in flexible ways to support various different design strategies.  ...  To solve this problem, we have developed a methodology for integrating optimization algorithms directly into workflows.  ...  We also acknowledge the US NSF funded PRIME project, (supporting Amirriazi and Chitters) and thank colleagues, in particular Peter Arzberger, for their strong support.  ... 
doi:10.1016/j.procs.2010.04.242 fatcat:s7zofcgg7fbcbltxaawd7pfxzm

Application of Multi-core Parallel Programming to a Combination of Ant Colony Optimization and Genetic Algorithm [article]

Rishita Kalyani
2014 arXiv   pre-print
This Paper will deal with a combination of Ant Colony and Genetic Programming Algorithm to optimize Travelling Salesmen problem (NP-Hard).  ...  to the combination of algorithm is achieved by OpenMP library by Intel Corporation.  ...  THE ACO-GA ALGORITHM This section, we propose an algorithm which uses Genetic process to enhance the result and performance of Ant Colony Optimization.  ... 
arXiv:1411.4297v1 fatcat:bb7oz2rhdzhgbb5umbogqew37i

Code Generation and Optimization of Distributed-memory Dense Linear Algebra Kernels

Bryan Marker, Don Batory, Robert van de Geijn
2013 Procedia Computer Science  
The goal of DxT is to mechanize the generation of highly-optimized code.  ...  Performance results on a BlueGene/P parallel supercomputer show that the generated code meets or beats implementations that are hand-coded by a human expert and outperforms the widely used ScaLAPACK library  ...  We are greatly indebted to Jack Poulson for his help to understand his Elemental library.  ... 
doi:10.1016/j.procs.2013.05.295 fatcat:vrwvb7hgarbktfjnm5dlhzbupm

A new parallel approach to the constrained two-dimensional cutting stock problem [chapter]

Stefan Tschöke, Norbert Holthöfer
1995 Lecture Notes in Computer Science  
In this paper we present a new parallelization of an efficient best-first branch-and-bound algorithm to solve the constrained two-dimensional single stock guillotine cutting stock problem (CSP) to optimality  ...  For an efficient parallelization we developed a new dynamic load-balancing algorithm, because due to the unusual branching strategy and detection of duplicates standard load balancing methods do not work  ...  For easiness and quick reference we give the informal algorithm: This algorithm for the cutting stock problem resembles A* algorithms (see [NKK84] ) which perform a best-first search for an optimal solution  ... 
doi:10.1007/3-540-60321-2_24 fatcat:rchmwvscszcy5k2jon47hcxwhm

Performance Evaluation of Matrix Multiplication Using Mix Mode Optimization Techniques And Open MP For Multi-Core Processors

Yogesh Singh Rathore
2014 IOSR Journal of Engineering  
The evaluation is based on simple execution of the algorithm that uses single thread for computation whereas the one with optimization techniques and OpenMP with multi-threads.  ...  Optimization techniques reduces space requirement and ensures fast execution. OpenMP is a very well known standard that exploits parallelism in shared memory architecture.  ...  OPTIMIZATION TECHNIQUES In this section we will introduce an effective combination of optimization techniques for Matrix Multiplication.  ... 
doi:10.9790/3021-04311922 fatcat:kzepdrng7zazxlwffmj4ar2c2m

Using Graphics Processing Units for Logic Simulation of Electronic Designs

Alper Sen, Baris Aksanli, Murat Bozkurt
2010 2010 11th International Workshop on Microprocessor Test and Verification  
Our algorithm exploits the massively parallel GPU architecture featuring thousands of concurrent threads, fast memory, and memory coalescing for optimizations.  ...  We parallelize logic simulation using Graphics Processing Units (GPUs). We present a parallel cycle-based logic simulation algorithm that uses And Inverter Graphs (AIGs) as design representations.  ...  ACKNOWLEDGMENTS We would like to thank Alan Mischenko from the UC Berkeley for suggesting and providing AIG benchmarks.  ... 
doi:10.1109/mtv.2010.21 dblp:conf/mtv/SenAB10 fatcat:a6tu3gmqcvflvo773aqx6uthpi

Listing combinatorial objects in parallel

Ivan Stojmenovic
2006 International Journal of Parallel, Emergent and Distributed Systems  
This article surveys parallel generation algorithms for listing all combinatorial objects of certain type. The algorithms are designed for a very simple model, linear array of processors.  ...  The methods are divided into three groups: division of instances into groups, shared instances and combined methods.  ...  Generating combinations In [2, 12] , an O(C(m,n)log m) time algorithm for generating m-combinations on an EREW PRAM using Method 2 is described.  ... 
doi:10.1080/17445760500355777 fatcat:hyv74hfce5akdczakpibqb5adq
« Previous Showing results 1 — 15 out of 650,786 results