2095 search results - page 233 / 419 » Improved pebbling bounds |
164
click to vote
DAC
1999
ACM
16 years 7 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
134
click to vote
DAC
2000
ACM
16 years 7 months ago
2000
ACM
A dynamic noise model is developed and applied to analyze the noise immunity of precharge-evaluate circuits. Considering that the primary source of noise-injection in the circuit ...
DAC
2005
ACM
16 years 7 months ago
2005
ACM
We present several improvements to general-purpose sequential redundancy removal. First, we propose using a robust variety of synergistic transformation and verification algorithm...
146
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
169
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...