2861 search results - page 327 / 573 » Constraint Programming |
186
click to vote
CPAIOR
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
169
click to vote
CAEPIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...
129
click to vote
CMSB
2003
Springer
15 years 11 months ago
2003
Springer
Alternative splicing is a key process in post-transcriptional regulation, by which several kinds of mature RNA can be obtained from the same premessenger RNA. Using a constraint pr...
162
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
We use a lexicographical preference order on the problem space to combine solution synthesis with conflict learning. Given two preferred solutions of two subproblems, we can either...
154
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
To find the best lattice model representation of a given full atom protein structure is a hard computational problem. Several greedy methods have been suggested where results are ...