Sciweavers

94 search results - page 2 / 19
» A branch and bound algorithm for the matrix bandwidth minimi...
Sort
View
CORR
2009
Springer
114views Education» more  CORR 2009»
13 years 3 months ago
Distributed Branching Bisimulation Minimization by Inductive Signatures
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
Stefan Blom, Jaco van de Pol
ANOR
2008
171views more  ANOR 2008»
13 years 5 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
CORR
2006
Springer
69views Education» more  CORR 2006»
13 years 5 months ago
Bounds on the coefficients of the characteristic and minimal polynomials
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
Jean-Guillaume Dumas
ARC
2010
Springer
387views Hardware» more  ARC 2010»
14 years 3 days ago
Optimising Memory Bandwidth Use for Matrix-Vector Multiplication in Iterative Methods
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community [1–3]...
David Boland, George A. Constantinides
IPPS
2002
IEEE
13 years 10 months ago
High-Performance Parallel and Distributed Computing for the BMI Eigenvalue Problem
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...
Kento Aida, Yoshiaki Futakata, Shinji Hara