ACTA
2005
13 years 4 months ago
2005
In online square packing, squares of different sizes arrive online and need to be packed into unit squares which are called bins. The goal is to minimize the number of bins used. ...
KI
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
ENDM
2007
13 years 4 months ago
2007
We show that the number of maximal sum-free subsets of {1, 2, . . . , n} is at most 23n/8+o(n) . We also show that 20.406n+o(n) is an upper bound on the number of maximal product-...
DM
2007
13 years 4 months ago
2007
An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with a...
JSYML
2008
13 years 4 months ago
2008
Abstract. We prove new upper bound theorems on the consistency strengths of SPFA(), SPFA(-linked) and SPFA(+ -cc). Our results are in terms of (, )-subcompactness, which is a new l...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
—Distributed orthogonal space–time block codes (DOSTBCs) achieving full-diversity order and single-symbol maximum-likelihood (ML) decodability have been introduced recently by ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
—A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels b...
DAM
2006
13 years 4 months ago
2006
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...