Sciweavers

94 search results - page 1 / 19
» A branch and bound algorithm for the matrix bandwidth minimi...
Sort
View
EOR
2008
82views more  EOR 2008»
13 years 4 months ago
A branch and bound algorithm for the matrix bandwidth minimization
Rafael Martí, Vicente Campos, Estefan&iacut...
CCGRID
2003
IEEE
13 years 10 months ago
Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and ...
Kento Aida, Wataru Natsume, Yoshiaki Futakata
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
13 years 10 months ago
Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem
In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and ...
Andrew Lim, Brian Rodrigues, Fei Xiao
DAGSTUHL
2007
13 years 6 months ago
Matrix Analytic Methods in Branching processes
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
Sophie Hautphenne, Guy Latouche, Marie-Ange Remich...
SAT
2005
Springer
122views Hardware» more  SAT 2005»
13 years 10 months ago
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications th...
Maher N. Mneimneh, Inês Lynce, Zaher S. Andr...