Sciweavers

6437 search results - page 179 / 1288
» Parallel Algorithms for Arrangements
Sort
View
PDSE
1998
105views more  PDSE 1998»
15 years 4 months ago
A Case-Based Parallel Programming System
This paper describes how to reduce the burden of parallel programming by utilizing relevant parallel programs. Parallel algorithms are divided into four classes and a case base fo...
Katsuhiro Yamazaki, Shoichi Ando
ATVA
2005
Springer
109views Hardware» more  ATVA 2005»
15 years 8 months ago
A New Reachability Algorithm for Symmetric Multi-processor Architecture
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. A naive parallelization of such algorithms ...
Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer,...
IPPS
2007
IEEE
15 years 9 months ago
Network-Oblivious Algorithms
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
Gianfranco Bilardi, Andrea Pietracaprina, Geppino ...
IPPS
2000
IEEE
15 years 7 months ago
Information Exchange in Multi Colony Ant Algorithms
Multi colony ant algorithms are evolutionary optimization heuristics that are well suited for parallel execution. Information exchange between the colonies is an important topic th...
Martin Middendorf, Frank Reischle, Hartmut Schmeck
CSE
2009
IEEE
15 years 9 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
Jonathan Widger, Daniel Grosu