6105 search results - page 185 / 1221 » A Parallel Algorithm for Bound-Smoothing |
155
click to vote
IPPS
2007
IEEE
16 years 19 days ago
2007
IEEE
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...
142
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
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...
143
Voted
CSE
2009
IEEE
16 years 1 months ago
2009
IEEE
—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...
139
Voted
PPSC
1997
15 years 7 months ago
1997
We present an overview of algorithms and data structures for dynamic re nement coarsening adaptation of unstructured FE meshes on loosely coupled parallel processors. We describ...
140
click to vote
SSD
1993
Springer
15 years 10 months ago
1993
Springer
Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for finding the volumes of the i...