Sciweavers

947 search results - page 136 / 190
» Discrete Geometry
Sort
View
CPAIOR
2009
Springer
15 years 4 months ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub
CPAIOR
2009
Springer
15 years 4 months ago
Sequencing and Counting with the multicost-regular Constraint
This paper introduces a global constraint encapsulating a regular constraint together with several cumulative costs. It is motivated in the context of personnel scheduling problems...
Julien Menana, Sophie Demassey
CPAIOR
2009
Springer
15 years 4 months ago
Open Constraints in a Boundable World
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint pro...
Michael J. Maher
CPM
2009
Springer
137views Combinatorics» more  CPM 2009»
15 years 4 months ago
The Structure of Level-k Phylogenetic Networks
Evolution is usually described as a phylogenetic tree, but due to some exchange of genetic material, it can be represented as a phylogenetic network which has an underlying tree st...
Philippe Gambette, Vincent Berry, Christophe Paul
COCOA
2007
Springer
15 years 3 months ago
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
Ernst Althaus, Stefan Canzar