364 search results - page 27 / 73 » Dimension Characterizations of Complexity Classes |
IANDC
2011
13 years 2 months ago
2011
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
COCO
1994
Springer
13 years 11 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
INFOCOM
1997
IEEE
13 years 11 months ago
1997
IEEE
In this paper we present algorithms for flow admission control at an EDF link scheduler when the flows are characterized by peak rate, average rate and burst size. We show that th...
GECCO
2010
Springer
13 years 10 months ago
2010
Springer
Genetic algorithms—a class of stochastic population-based optimization techniques—have been widely realized as the effective tools to solve complicated optimization problems ...