Sciweavers

5506 search results - page 452 / 1102
» Minimal Logic Programs
Sort
View
MP
2006
121views more  MP 2006»
15 years 6 months ago
Approximate fixed-rank closures of covering problems
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
Daniel Bienstock, Mark Zuckerberg
ASPDAC
2006
ACM
116views Hardware» more  ASPDAC 2006»
16 years 25 days ago
Abridged addressing: a low power memory addressing strategy
Abstract— The memory subsystem is known to comprise a significant fraction of the power dissipation in embedded systems. The memory addressing strategy, which determines the seq...
Preeti Ranjan Panda
DEXAW
2002
IEEE
99views Database» more  DEXAW 2002»
15 years 11 months ago
Using Preference Order in Ontologies
The latest ontology languages can be translated into a description logic (DL), thus providing them with a formal semantics and associated reasoning procedures. We introduce the or...
Stijn Heymans, Dirk Vermeir
DFT
2002
IEEE
121views VLSI» more  DFT 2002»
15 years 11 months ago
Testing Digital Circuits with Constraints
Many digital circuits have constraints on the logic values a set of signal lines can have. In this paper, we present two new techniques for detecting the illegal combinations of l...
Ahmad A. Al-Yamani, Subhasish Mitra, Edward J. McC...
CL
2000
Springer
15 years 11 months ago
Applications of Annotated Predicate Calculus to Querying Inconsistent Databases
Abstract. We consider the problem of specifying and computing consistent answers to queries against databases that do not satisfy given integrity constraints. This is done by simul...
Marcelo Arenas, Leopoldo E. Bertossi, Michael Kife...