2095 search results - page 169 / 419 » Improved pebbling bounds |
169
click to vote
JAPLL
2010
15 years 5 months ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
183
click to vote
JCT
2010
15 years 5 months ago
2010
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
195
click to vote
TCOM
2010
15 years 4 months ago
2010
In this paper we formally analyze the interleaver and code design for QAM-based BICM transmissions using the binary reflected Gray code. We develop analytical bounds on the bit e...
179
click to vote
TRANSCI
2010
15 years 4 months ago
2010
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
205
click to vote
WIOPT
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...