224 search results - page 9 / 45 » G-graphs for the cage problem: a new upper bound |
163
click to vote
MOR
2010
15 years 4 months ago
2010
In this paper we study the problem of bounding the value of the probability distribution function of a random variable X at E[X] + a where a is a small quantity in comparison with...
158
click to vote
AMC
2010
15 years 6 months ago
2010
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
147
click to vote
ANOR
2011
15 years 1 months ago
2011
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
145
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We present new bounds on the first selection lemma in R3 . This makes progress on the open problems of Bukh, Matoušek and Nivash [6] and Boros-Füredi [4] for the three-dimensio...
261
click to vote
CN
2007
15 years 6 months ago
2007
Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to o...