2925 search results - page 84 / 585 » Information Complexity of Online Problems |
182
click to vote
ISW
2010
Springer
15 years 4 months ago
2010
Springer
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
145
click to vote
RSP
2007
IEEE
16 years 13 days ago
2007
IEEE
Designing security softwares that evolve as quickly as threats is a truthful challenge. In addition, current software becomes increasingly more complex and difficult to handle ev...
155
Voted
LATIN
1998
Springer
15 years 10 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
154
click to vote
AIPS
2004
15 years 7 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
180
click to vote
LION
2007
Springer
16 years 9 days ago
2007
Springer
This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered i...