Sciweavers

719 search results - page 50 / 144
» Solving Sparse Linear Constraints
Sort
View
IPPS
1998
IEEE
15 years 3 months ago
High Performance Linear Algebra Package LAPACK90
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
Jack Dongarra, Jerzy Wasniewski
ML
2002
ACM
167views Machine Learning» more  ML 2002»
14 years 10 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
CONCUR
2000
Springer
15 years 3 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
15 years 5 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
EUROPAR
2004
Springer
15 years 4 months ago
Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
Ondrej Medek, Pavel Tvrdík, Jaroslav Kruis