173 search results - page 14 / 35 » Asymptotic classes of finite structures |
AUTOMATICA
2008
15 years 17 days ago
2008
We investigate limits of performance in reference-tracking and path-following and highlight an essential difference between them. For a class of nonlinear systems, we show that in...
COMBINATORICS
1999
15 years 4 days ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
87
Voted
CSL
2010
Springer
15 years 16 days ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
JMLR
2002
15 years 3 days ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
91
Voted
TON
2010
14 years 7 months ago
2010
Abstract-- In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a...