1092 search results - page 128 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
150
click to vote
WABI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
132
click to vote
CPAIOR
2004
Springer
15 years 11 months ago
2004
Springer
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
157
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
146
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...
163
click to vote
ESA
1999
Springer
15 years 10 months ago
1999
Springer
We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...