5 search results - page 1 / 1 » Parameters for which the Griesmer bound is not sharp |
DM
2007
13 years 10 months ago
2007
7 We prove for a large class of parameters t and r that a multiset of at most t d−k + r d−k−2 points in PG(d, q) that blocks every k-dimensional subspace at least t times mu...
JSCIC
2010
13 years 5 months ago
2010
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D of the origina...
RSA
2010
13 years 9 months ago
2010
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
COCO
2010
Springer
14 years 2 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
QUESTA
2010
13 years 9 months ago
2010
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...