Sciweavers

1960 search results - page 111 / 392
» The Logic of Large Enough
Sort
View
FPGA
2004
ACM
126views FPGA» more  FPGA 2004»
14 years 2 months ago
A synthesis oriented omniscient manual editor
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
Tomasz S. Czajkowski, Jonathan Rose
DLOG
2004
13 years 10 months ago
Using Non-Primitive Concept Definitions for Improving DL-based Knowledge Bases
Medical Terminological Knowledge Bases contain a large number of primitive concept definitions. This is due to the large number of natural kinds that are represented, and due to t...
Ronald Cornet, Ameen Abu-Hanna
IBMRD
2006
63views more  IBMRD 2006»
13 years 9 months ago
Decomposing the load-store queue by function for power reduction and scalability
Because they are based on large content-addressable memories, load-store queues (LSQ) present implementation challenges in superscalar processors, especially as issue width and nu...
Lee Baugh, Craig B. Zilles
ICCAD
2003
IEEE
149views Hardware» more  ICCAD 2003»
14 years 6 months ago
Algorithm for Achieving Minimum Energy Consumption in CMOS Circuits Using Multiple Supply and Threshold Voltages at the Module L
This paper proposes an optimum methodology for assigning supply and threshold voltages to modules in a CMOS circuit such that the overall energy consumption is minimized for a giv...
Yuvraj Singh Dhillon, Abdulkadir Utku Diril, Abhij...
GBRPR
2007
Springer
14 years 3 months ago
Approximating TSP Solution by MST Based Graph Pyramid
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
Yll Haxhimusa, Walter G. Kropatsch, Zygmunt Pizlo,...