2109 search results - page 96 / 422 » Solving Necklace Constraint Problems |
169
Voted
RECOMB
2010
Springer
15 years 3 months ago
2010
Springer
We study two problems in the double cut and join (DCJ) model: sorting – transforming one multilinear genome into another and halving – transforming a duplicated genome into a p...
150
click to vote
ICAPR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper addresses the clustering problem of hidden dynamical systems behind observed multivariate sequences by assuming an interval-based temporal structure in the seq...
147
Voted
DATE
2007
IEEE
15 years 11 months ago
2007
IEEE
We present a decomposition strategy to speed up constraint optimization for a representative multiprocessor scheduling problem. In the manner of Benders decomposition, our techniq...
144
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
145
click to vote
ACL
1998
15 years 6 months ago
1998
We introduce a first-order language for semantic underspecification that we call Constraint Language for Lambda-Structures (CLLS). A Astructure can be considered as a A-term up to...