Sciweavers

1559 search results - page 139 / 312
» Fundamentals of Generic Programming
Sort
View
PDPTA
2000
14 years 11 months ago
Constant Multipliers for FPGAs
This paper presents a survey of techniques to implement multiplications by constants on FPGAs. It shows in particular that a simple and well-known technique, canonical signed recod...
Florent de Dinechin, Vincent Lefèvre
WSC
1998
14 years 11 months ago
GMSim: A Tool for Compositional GSMP Modeling
The development of a discrete-event simulation tool, called GMSim, based on the generalized semi-Markov process (GSMP) formalism is described. The GSMP representation comprises bo...
Frode B. Nilson
IPAW
2010
14 years 7 months ago
Data Provenance in Distributed Propagator Networks
Abstract. The heterogeneous and unreliable nature of distributed systems has created a distinct need for the inclusion of provenance within their design to allow for error correcti...
Ian Jacobi
LPNMR
2009
Springer
15 years 4 months ago
Belief Revision with Bounded Treewidth
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
ASPDAC
2004
ACM
87views Hardware» more  ASPDAC 2004»
15 years 3 months ago
ShatterPB: symmetry-breaking for pseudo-Boolean formulas
Many important tasks in circuit design and verification can be performed in practice via reductions to Boolean Satisfiability (SAT), making SAT a fundamental EDA problem. However ...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...