4103 search results - page 202 / 821 » Some results on the Collatz problem |
183
click to vote
AAECC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
192
click to vote
IOR
2007
15 years 6 months ago
2007
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
167
click to vote
CC
2002
Springer
15 years 6 months ago
2002
Springer
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...
143
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Approximate Linear Programming (ALP) is a reinforcement learning technique with nice theoretical properties, but it often performs poorly in practice. We identify some reasons for...
209
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...