Sciweavers

2303 search results - page 185 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
IPPS
2003
IEEE
15 years 11 months ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner
ICDCS
2000
IEEE
15 years 11 months ago
The Effect of Nogood Learning in Distributed Constraint Satisfaction
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
Makoto Yokoo, Katsutoshi Hirayama
IPPS
1998
IEEE
15 years 10 months ago
Local Enumeration Techniques for Sparse Algorithms
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
Gerardo Bandera, Pablo P. Trabado, Emilio L. Zapat...
ISORC
2006
IEEE
16 years 16 days ago
Portable Data Exchange for Remote-Testing Frameworks
To communicate between heterogeneous computer systems, mechanisms for data conversion are necessary. In this paper we present a portable, asymmetric data conversion method that is...
Raimund Kirner, Peter P. Puschner, Ingomar Wenzel,...
IPPS
2007
IEEE
16 years 25 days ago
Building the Tree of Life on Terascale Systems
Bayesian phylogenetic inference is an important alternative to maximum likelihood-based phylogenetic method. However, inferring large trees using the Bayesian approach is computat...
Xizhou Feng, Kirk W. Cameron, Carlos P. Sosa, Bria...