Sciweavers

5592 search results - page 430 / 1119
» On Random Betweenness Constraints
Sort
View
ICCAD
2000
IEEE
148views Hardware» more  ICCAD 2000»
15 years 11 months ago
FIR Filter Synthesis Algorithms for Minimizing the Delay and the Number of Adders
—As the complexity of digital filters is dominated by the number of multiplications, many works have focused on minimizing the complexity of multiplier blocks that compute the co...
Hyeong-Ju Kang, Hansoo Kim, In-Cheol Park
CP
2000
Springer
15 years 11 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
15 years 11 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill
MM
1993
ACM
126views Multimedia» more  MM 1993»
15 years 11 months ago
CMIFed: A Presentation Environment for Portable Hypermedia Documents
as a tree which specifies the presentation in an abstract, machineindependent way. This specification is created and edited using an authoring system; it is mapped to a particula...
Guido van Rossum, Jack Jansen, K. Sjoerd Mullender...
PEPM
1993
ACM
15 years 11 months ago
Binding-Time Analysis and the Taming of C Pointers
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
Lars Ole Andersen