Sciweavers

2303 search results - page 41 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
PDPTA
1996
13 years 10 months ago
Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
Darrell R. Ulm, Johnnie W. Baker
CSC
2010
13 years 6 months ago
Accuracy of the Immersed Boundary Method in Fixed-Point Arithmetic
Abstract-- The immersed boundary (IB) method is an algorithm for simulating elastic structures immersed in a fluid. The IB method can be used, for example, to simulate blood flow i...
Gabor Ferencz, Eric Peskin, Charles Peskin
IPPS
2003
IEEE
14 years 2 months ago
Accurate Method for Fast Design of Diagnostic Oligonucleotide Probe Sets for DNA Microarrays
We present a method for the automatic generation of oligonucleotide probe sets for DNA microarrays. This approach is well suited particularly for specificity evaluation of design...
Andreas Krause, Markus Kräutner, Harald Meier
IPPS
1999
IEEE
14 years 1 months ago
A Graph Based Method for Generating the Fiedler Vector of Irregular Problems
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
Michael Holzrichter, Suely Oliveira
ECOOPW
1998
Springer
14 years 12 days ago
Providing Automatic Support for Heuristic Rules of Methods
In method-based software development, software engineers create artifacts based on the heuristic rules of the adopted method. Most CASE tools, however, do not actively assist soft...
Bedir Tekinerdogan, Mehmet Aksit