Sciweavers

1727 search results - page 125 / 346
» A Technique for Large Automated Mechanism Design Problems
Sort
View
DAC
2002
ACM
16 years 7 months ago
A fast on-chip profiler memory
Profiling an application executing on a microprocessor is part of the solution to numerous software and hardware optimization and design automation problems. Most current profilin...
Roman L. Lysecky, Susan Cotterell, Frank Vahid
DAC
2003
ACM
16 years 7 months ago
A new enhanced constructive decomposition and mapping algorithm
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
Alan Mishchenko, Xinning Wang, Timothy Kam
IJCNN
2007
IEEE
16 years 23 days ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
DAC
2005
ACM
16 years 7 months ago
A new canonical form for fast boolean matching in logic synthesis and verification
? An efficient and compact canonical form is proposed for the Boolean matching problem under permutation and complementation of variables. In addition an efficient algorithm for co...
Afshin Abdollahi, Massoud Pedram
ISLPED
2009
ACM
161views Hardware» more  ISLPED 2009»
16 years 1 months ago
Way guard: a segmented counting bloom filter approach to reducing energy for set-associative caches
The design trend of caches in modern processors continues to increase their capacity with higher associativity to cope with large data footprint and take advantage of feature size...
Mrinmoy Ghosh, Emre Özer, Simon Ford, Stuart ...