Suchergebnisse - parallel computing combinatorial algorithms combinatorial scientific computing

Approximation algorithms in combinatorial scientific computing von Pothen, Alex, Ferdous, S. M., Manne, Fredrik

“… We survey recent work on approximation algorithms for computing degree-constrained subgraphs in graphs and their applications in combinatorial scientific computing …”
Volltext

Combinatorial Scientific Computing von Naumann, Uwe, Schenk, Olaf

“… This volume explores the latest research on creating algorithms and software tools to solve key combinatorial problems on large-scale high-performance computing architectures …”
Volltext

The projector algorithm: A simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs von Reem, Daniel

“… The theory of algorithms for computing 2D Euclidean Voronoi diagrams of point sites is rich and useful, with several different and important algorithms …”
Volltext

Parallel graph coloring algorithms for distributed GPU environments von Bogle, Ian, Slota, George M., Boman, Erik G., Devine, Karen D., Rajamanickam, Sivasankaran

“… ; it identifies sets of independent data that can be updated in parallel. Many algorithms exist for graph coloring on a single GPU or in distributed memory, but to the best of our knowledge, hybrid MPI …”
Volltext

Parallelization of combinatorial search when solving knapsack optimization problem on computing systems based on multicore processors von Rahman, P A

“… This scientific paper deals with the model of the knapsack optimization problem and method of its solving based on directed combinatorial search in the boolean space …”
Volltext

Quantum-inspired metaheuristic algorithms: comprehensive survey and classification von Gharehchopogh, Farhad Soleimanian

“… The Quantum-inspired metaheuristic algorithms were developed by integrating Quantum Computing (QC …”
Volltext

The Zoltan and Isorropia Parallel Toolkits for Combinatorial Scientific Computing: Partitioning, Ordering and Coloring von Boman, Erik G., Çatalyürek, Ümit V., Chevalier, Cédric, Devine, Karen D.

“… Partitioning and load balancing are important problems in scientific computing that can be modeled as combinatorial problems using graphs or hypergraphs …”
Volltext

A cooperative parallel tabu search algorithm for the quadratic assignment problem von James, Tabitha, Rego, Cesar, Glover, Fred

“… In this study, we introduce a cooperative parallel tabu search algorithm (CPTS) for the quadratic assignment problem (QAP …”
Volltext

An optimization spiking neural p system for approximately solving combinatorial optimization problems von Zhang, Gexiang, Rong, Haina, Neri, Ferrante, Pérez-Jiménez, Mario J

“… Spiking neural P systems (SNPS) are a class of distributed and parallel computing models that incorporate the idea of spiking neurons into P systems …”
Weitere Angaben

Graph coloring algorithms for multi-core and massively multithreaded architectures von Çatalyürek, Ümit V., Feo, John, Gebremedhin, Assefaw H., Halappanavar, Mahantesh, Pothen, Alex

“… We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and high-performance …”
Volltext

Hybrid Metaheuristics Based on Evolutionary Algorithms and Simulated Annealing: Taxonomy, Comparison, and Synergy Test von Rodriguez, F. J., Garcia-Martinez, C., Lozano, M.

“… The design of hybrid metaheuristics with ideas taken from the simulated annealing and evolutionary algorithms fields is a fruitful research line …”
Volltext

Parallel Branch-Cut Algorithm Based on Simulated Annealing for Large-Scale Phase Unwrapping von Huang, Qian, Zhou, Huiqun, Dong, Shaochun, Xu, Shijin

“… Owing to only a single process used in most previous algorithm implementations, it becomes more problematic to unwrapping when the required computing resources exceed the capability of one computer …”
Volltext

A practitioner’s guide to quantum algorithms for optimisation problems von Symons, Benjamin C B, Galvin, David, Sahin, Emre, Alexandrov, Vassil, Mensa, Stefano

Volltext

A Unified Framework for Numerical and Combinatorial Computing von Gilbert, John R., Reinhardt, Steve, Shah, Viral B.

“… The authors describe their efforts to build a common infrastructure for numerical and combinatorial computing by using parallel sparse matrices to implement parallel graph …”
Volltext

Divide-and-price: A decomposition algorithm for solving large railway crew scheduling problems von Jütte, Silke, Thonemann, Ulrich W.

“… ► Decomposition of crew scheduling instances substantially accelerates column generation algorithms …”
Volltext

On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe von Çatalyürek, Ümt V., Aykanat, Cevdet, Uçar, Bora

“… We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation …”
Volltext

A parallel iterated tabu search heuristic for vehicle routing problems von Cordeau, Jean-François, Maischberger, Mirko

“… This paper introduces a parallel iterated tabu search heuristic for solving four different routing problems …”
Volltext

An Adaptive Optimization Spiking Neural P System for Binary Problems von Zhu, Ming, Yang, Qiang, Dong, Jianping, Zhang, Gexiang, Gou, Xiantai, Rong, Haina, Paul, Prithwineel, Neri, Ferrante

“… OSNPS is composed of a family of parallel Spiking Neural P Systems (SNPS) that generate candidate solutions of the binary combinatorial problem and a Guider algorithm that adjusts the spiking probabilities of the neurons of the P systems …”
Weitere Angaben

A hybrid genetic algorithm for multiobjective problems with activity analysis-based local search von Whittaker, Gerald, Confesor, Remegio, Griffith, Stephen M., Färe, Rolf, Grosskopf, Shawna, Steiner, Jeffrey J., Mueller-Warrant, George W., Banowetz, Gary M.

“… We describe a parallel computing approach to computation of the genetic algorithm, and apply the algorithm to evaluation of an input tax to regulate pollution …”
Volltext

An optimal multiprocessor combinatorial auction solver von Yang, Shouxi, Segre, Alberto Maria, Codenotti, Bruno

“… The algorithm uses nagging, a technique for parallelizing search in heterogeneous distributed computing environments …”
Volltext