725 search results - page 22 / 145 » Bounding Degrees on RPL |
175
click to vote
RTAS
2011
IEEE
14 years 1 months ago
2011
IEEE
The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of...
SIAMDM
2010
14 years 4 months ago
2010
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
APAL
2006
14 years 9 months ago
2006
Abstract. We show that the identity bounded Turing degrees of computably enumerable sets are not dense.
65
Voted
MOC
1998
14 years 9 months ago
1998
We give bounds for the coefficients of a polynomial as functions of the diameter of its roots, hence we obtain polynomials with minimal diameters and small degree
ECCC
2010
14 years 8 months ago
2010
In this paper we study the degree of non-constant symmetric functions f : {0, 1}n → {0, 1, . . . , c}, where c ∈ N, when represented as polynomials over the real numbers. We s...