2944 search results - page 277 / 589 » Improving Bound Propagation |
164
click to vote
ASPDAC
1995
ACM
15 years 10 months ago
1995
ACM
In this article a scheduling method is presented which is capable of allocating supplementary resources during scheduling. This makes it very suitable in synthesis strategies base...
178
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...
181
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
152
click to vote
FM
2008
Springer
15 years 8 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
169
click to vote
CCCG
2010
15 years 8 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...