778 search results - page 47 / 156 » Bounding Smooth Integers |
CPC
2000
13 years 7 months ago
2000
We examine the specialization to simple matroids of certain problems in extremal matroid theory that are concerned with bounded cocircuit size. Assume that each cocircuit of a simp...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We show that for every n-point metric space M and positive integer k, there exists a spanning tree T with unweighted diameter O(k) and weight w(T) = O(k · n1/k ) · w(MST(M)), an...
ISPAN
2002
IEEE
14 years 17 days ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
APLAS
2010
ACM
13 years 5 months ago
2010
ACM
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...