2109 search results - page 96 / 422 » Solving Necklace Constraint Problems |
211
click to vote
RECOMB
2010
Springer
15 years 5 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...
181
click to vote
ICAPR
2005
Springer
16 years 6 days 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...
174
click to vote
DATE
2007
IEEE
16 years 1 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...
173
click to vote
SAC
2010
ACM
16 years 1 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...
173
click to vote
ACL
1998
15 years 8 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...