Sciweavers

267 search results - page 16 / 54
» Generating all maximal models of a Boolean expression
Sort
View
AGP
2003
IEEE
14 years 27 days ago
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assu...
Gerald Pfeifer
ASYNC
2000
IEEE
122views Hardware» more  ASYNC 2000»
14 years 1 days ago
DUDES: A Fault Abstraction and Collapsing Framework for Asynchronous Circuits
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
Philip P. Shirvani, Subhasish Mitra, Jo C. Ebergen...
ISCAS
2006
IEEE
106views Hardware» more  ISCAS 2006»
14 years 1 months ago
Integrating observability don't cares in all-solution SAT solvers
— All-solution Boolean satisfiability (SAT) solvers are engines employed to find all the possible solutions to a SAT problem. Their applications are found throughout the EDA in...
Sean Safarpour, Andreas G. Veneris, Rolf Drechsler
OTM
2010
Springer
13 years 5 months ago
On the Expressiveness and Trade-Offs of Large Scale Tuple Stores
Massive-scale distributed computing is a challenge at our doorstep. The current exponential growth of data calls for massive-scale capabilities of storage and processing. This is b...
Ricardo Vilaça, Francisco Cruz, Rui Carlos ...
CVPR
2003
IEEE
14 years 9 months ago
Video Segmentation Based on Graphical Models
This paper proposes a unified framework for spatiotemporal segmentation of video sequences. A Bayesian network is presented to model the interactions among the motion vector field...
Kia-Fock Loe, Tele Tan, Yang Wang 0002