Sciweavers

4759 search results - page 242 / 952
» Parallelizing the Phylogeny Problem
Sort
View
127
Voted
IJHPCA
2010
105views more  IJHPCA 2010»
15 years 25 days ago
A Pipelined Algorithm for Large, Irregular All-Gather Problems
We describe and evaluate a new, pipelined algorithm for large, irregular all-gather problems. In the irregular all-gather problem each process in a set of processes contributes in...
Jesper Larsson Träff, Andreas Ripke, Christia...
EOR
2007
104views more  EOR 2007»
15 years 2 months ago
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
Roberto Baldacci, Marco A. Boschetti
JC
2007
160views more  JC 2007»
15 years 2 months ago
BDDC methods for discontinuous Galerkin discretization of elliptic problems
A discontinuous Galerkin (DG) discretization of Dirichlet problem for second-order elliptic equations with discontinuous coefficients in 2-D is considered. For this discretization...
Maksymilian Dryja, Juan Galvis, Marcus Sarkis
IFIPTCS
2010
15 years 9 days ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
15 years 6 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin