Sciweavers

877 search results - page 63 / 176
» Structural Cut Elimination
Sort
View
FPGA
2001
ACM
145views FPGA» more  FPGA 2001»
14 years 8 days ago
Simultaneous logic decomposition with technology mapping in FPGA designs
Conventional technology mapping algorithms for SRAM-based Field Programmable Gate Arrays (FPGAs) are normally carried out on a fixed logic decomposition of a circuit. The impact o...
Gang Chen, Jason Cong
VISUALIZATION
2000
IEEE
14 years 5 days ago
Visualizing volume data using physical models
Visualization techniques enable scientists to interactively explore 3D data sets, segmenting and cutting them to reveal inner structure. While powerful, these techniques suffer fr...
David R. Nadeau, Michael J. Bailey
ICLP
1995
Springer
13 years 11 months ago
Operational Semantics of Constraint Logic Programs with Coroutining
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
Andreas Podelski, Gert Smolka
DKE
2007
75views more  DKE 2007»
13 years 7 months ago
Weaving temporal and reliability aspects into a schema tapestry
In aspect-oriented programming (AOP) a cross-cutting concern is implemented in an aspect. An aspect weaver blends code from the aspect into a program’s code at programmer-specifi...
Curtis E. Dyreson, Richard T. Snodgrass, Faiz Curr...
CORR
2004
Springer
113views Education» more  CORR 2004»
13 years 7 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers