5595 search results - page 376 / 1119 » Comparing Subsumption Optimizations |
173
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
The race conditions often limit the smallest feasible clock period that the optimal clock skew scheduling can achieve. Therefore, the combination of clock skew scheduling and dela...
170
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
210
click to vote
ICML
2001
IEEE
16 years 7 months ago
2001
IEEE
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
195
click to vote
ICCD
2005
IEEE
16 years 3 months ago
2005
IEEE
Presently, Architecture Description Languages (ADLs) are widely used to raise the abstraction level of the design space exploration of Application Specific Instruction-set Proces...
145
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
Current design automation methodologies are becoming incapable of achieving design closure especially in the presence of deep submicron effects. This paper addresses the issue of ...