Sciweavers

1552 search results - page 144 / 311
» On the Complexity of Constant Propagation
Sort
View
JSAT
2008
85views more  JSAT 2008»
15 years 6 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
KAIS
2006
87views more  KAIS 2006»
15 years 6 months ago
Merging uncertain information with semantic heterogeneity in XML
Semi-structured information in XML can be merged in a logic-based framework [Hun02, Hun02b]. This framework has been extended to deal with uncertainty, in the form of probability ...
Anthony Hunter, Weiru Liu
TIT
2008
102views more  TIT 2008»
15 years 6 months ago
Average Stopping Set Weight Distributions of Redundant Random Ensembles
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
Tadashi Wadayama
TVLSI
2002
366views more  TVLSI 2002»
15 years 6 months ago
Gate-diffusion input (GDI): a power-efficient method for digital combinatorial circuits
Gate diffusion input (GDI)--a new technique of low-power digital combinatorial circuit design--is described. This technique allows reducing power consumption, propagation delay, an...
Arkadiy Morgenshtein, Alexander Fish, Israel A. Wa...
VC
2010
134views more  VC 2010»
15 years 4 months ago
Detail-driven digital hologram generation
Abstract Digital holography is a technology with a potential to provide realistic 3D images. However, generation of digital holograms is a computationally demanding task. Thus, the...
Ivo Hanák, Martin Janda, Václav Skal...