Sciweavers

1523 search results - page 244 / 305
» Partially ordered secretaries
Sort
View
AI
2008
Springer
15 years 23 days ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
98
Voted
ANOR
2010
123views more  ANOR 2010»
15 years 23 days ago
Nature inspired genetic algorithms for hard packing problems
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
Philipp Rohlfshagen, John A. Bullinaria
94
Voted
BMCBI
2010
95views more  BMCBI 2010»
15 years 23 days ago
Heuristics for the inversion median problem
Background: The study of genome rearrangements has become a mainstay of phylogenetics and comparative genomics. Fundamental in such a study is the median problem: given three geno...
Vaibhav Rajan, Andrew Wei Xu, Yu Lin, Krister M. S...
BMCBI
2007
107views more  BMCBI 2007»
15 years 23 days ago
Progressive multiple sequence alignments from triplets
Motivation: The quality of progressive sequence alignments strongly depends on the accuracy of the individual pairwise alignment steps since gaps that are introduced at one step c...
Matthias Kruspe, Peter F. Stadler
CORR
2010
Springer
137views Education» more  CORR 2010»
15 years 22 days ago
Verification of Java Bytecode using Analysis and Transformation of Logic Programs
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...
Elvira Albert, Miguel Gómez-Zamalloa, Laure...