Sciweavers

1064 search results - page 78 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
RECOMB
2006
Springer
16 years 4 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
153
Voted
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
15 years 4 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter
JGO
2010
100views more  JGO 2010»
14 years 11 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
161
Voted
SIAMSC
2010
142views more  SIAMSC 2010»
15 years 2 months ago
Nested Iteration and First-Order System Least Squares for Incompressible, Resistive Magnetohydrodynamics
This paper develops a nested iteration algorithm to solve time-dependent nonlinear systems of partial differential equations. For each time step, Newton’s method is used to form...
J. H. Adler, Thomas A. Manteuffel, Stephen F. McCo...
132
Voted
JMLR
2006
145views more  JMLR 2006»
15 years 4 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street