92 search results - page 18 / 19 » Deterministic Restrictions in Circuit Complexity |
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
ICGI
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
GLVLSI
2010
IEEE
13 years 9 months ago
2010
IEEE
In this paper, we present an approved linear-time algorithm for statistical leakage analysis in the present of any spatial correlation condition (strong or weak). The new algorith...
DAC
2012
ACM
11 years 9 months ago
2012
ACM
Due to the breakdown of Dennardian scaling, the percentage of a silicon chip that can switch at full frequency is dropping exponentially with each process generation. This utiliza...