Sciweavers

143 search results - page 14 / 29
» Combination of Among and Cardinality Constraints
Sort
View
VLDB
2001
ACM
151views Database» more  VLDB 2001»
14 years 11 months ago
Approximate query mapping: Accounting for translation closeness
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
Kevin Chen-Chuan Chang, Hector Garcia-Molina
MIDDLEWARE
2007
Springer
14 years 5 months ago
Rule-based reasoning about qualitative spatiotemporal relations
This paper is about a novel rule-based approach for reasoning about qualitative spatiotemporal relations among technology-rich autonomous objects, to which we refer to as artifact...
Clemens Holzmann
VLSID
2008
IEEE
133views VLSI» more  VLSID 2008»
14 years 11 months ago
Exhaustive Enumeration of Legal Custom Instructions for Extensible Processors
Today's customizable processors allow the designer to augment the base processor with custom accelerators. By choosing appropriate set of accelerators, designer can significa...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
DAC
2002
ACM
14 years 12 months ago
TCG-S: orthogonal coupling of P*-admissible representations for general floorplans
We extend in this paper the concept of the P-admissible floorplan representation to that of the P*-admissible one. A P*-admissible representation can model the most general floorp...
Jai-Ming Lin, Yao-Wen Chang
JSAT
2006
134views more  JSAT 2006»
13 years 11 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah