Sciweavers

449 search results - page 10 / 90
» Evolutionary Approaches to Linear Ordering Problem
Sort
View
ALGORITHMICA
2008
52views more  ALGORITHMICA 2008»
13 years 7 months ago
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
V. Berry, Z. S. Peng, H. F. Ting
ICLP
2004
Springer
14 years 22 days ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
EVOW
2004
Springer
14 years 22 days ago
Disjoint Sum of Product Minimization by Evolutionary Algorithms
Recently, an approach has been presented to minimize Disjoint Sumof-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for larg...
Nicole Drechsler, Mario Hilgemeier, Görschwin...
BIOINFORMATICS
2007
123views more  BIOINFORMATICS 2007»
13 years 7 months ago
A comparative genome approach to marker ordering
Motivation: Genome maps are fundamental to the study of an organism and essential in the process of genome sequencing which in turn provides the ultimate map of the genome. The in...
Thomas Faraut, Simon de Givry, Patrick Chabrier, T...
CODES
2005
IEEE
14 years 29 days ago
An integer linear programming approach for identifying instruction-set extensions
This paper presents an Integer Linear Programming (ILP) approach to the instruction-set extension identification problem. An algorithm that iteratively generates and solves a set...
Kubilay Atasu, Günhan Dündar, Can C. &Ou...