2252 search results - page 69 / 451 » Lower Bounds for Dynamic Algorithms |
STOC
2003
ACM
14 years 8 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...
CIMCA
2008
IEEE
14 years 2 months 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, ...
MSS
2010
IEEE
13 years 6 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...
MFCS
2007
Springer
14 years 1 months 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 ...
AAECC
2003
Springer
14 years 29 days 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...