Sciweavers

1064 search results - page 17 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
15 years 5 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard
COCOON
2005
Springer
15 years 1 months ago
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...
118
Voted
BMCBI
2008
116views more  BMCBI 2008»
14 years 11 months ago
Clustering exact matches of pairwise sequence alignments by weighted linear regression
Background: At intermediate stages of genome assembly projects, when a number of contigs have been generated and their validity needs to be verified, it is desirable to align thes...
Alvaro J. González, Li Liao
EVOW
2007
Springer
15 years 5 months ago
Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms
Abstract. This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Integer Linear Programming (ILP) and Genetic Algori...
Napoleão Nepomuceno, Plácido Rog&eac...
78
Voted
DM
2006
91views more  DM 2006»
14 years 11 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber