Sciweavers

3250 search results - page 96 / 650
» An Algorithm to Solve a Linear Program
Sort
View
IPPS
2002
IEEE
15 years 2 months ago
A High Performance Algorithm for Incompressible Flows Using Local Solenoidal Functions
The convergence of iterative methods used to solve the linear systems arising in incompressible flow problems is sensitive to flow parameters such as the Reynolds number, time s...
Sreekanth R. Sambavaram, Vivek Sarin
DATE
2004
IEEE
123views Hardware» more  DATE 2004»
15 years 1 months ago
On Concurrent Error Detection with Bounded Latency in FSMs
We discuss the problem of concurrent error detection (CED) with bounded latency in finite state machines (FSMs). The objective of this approach is to reduce the overhead of CED, a...
Sobeeh Almukhaizim, Petros Drineas, Yiorgos Makris
IFIP
2004
Springer
15 years 3 months ago
Solving Packing Problem with Weaker Block Solvers
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
Hu Zhang
CSB
2005
IEEE
129views Bioinformatics» more  CSB 2005»
15 years 3 months ago
A Pivoting Algorithm for Metabolic Networks in the Presence of Thermodynamic Constraints
A linear programming algorithm is presented to constructively compute thermodynamically feasible fluxes and change in chemical potentials of reactions for a metabolic network. It...
R. Nigam, S. Liang
JCT
2000
103views more  JCT 2000»
14 years 9 months ago
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
Alexander Schrijver