2252 search results - page 69 / 451 » Lower Bounds for Dynamic Algorithms |
147
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
188
click to vote
CIMCA
2008
IEEE
16 years 19 days ago
2008
IEEE
Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, ...
120
click to vote
MSS
2010
IEEE
15 years 4 months ago
2010
IEEE
Overlapping generations are extracting a natural resource over an infinite future. We examine fair allocation of resource and compensations among generations. Fairness is define...
144
click to vote
MFCS
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
143
click to vote
AAECC
2003
Springer
15 years 11 months ago
2003
Springer
We examine 2-dimensional 3-dispersion lattice interleavers in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight...