Sciweavers

3775 search results - page 370 / 755
» The Expression Problem Revisited
Sort
View
SAT
2004
Springer
97views Hardware» more  SAT 2004»
16 years 6 days ago
Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization
Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...
Vasco M. Manquinho, João P. Marques Silva
ESWS
2010
Springer
15 years 11 months ago
Leveraging Terminological Structure for Object Reconciliation
Abstract. It has been argued that linked open data is the major benefit of semantic technologies for the web as it provides a huge amount of structured data that can be accessed i...
Jan Noessner, Mathias Niepert, Christian Meilicke,...
TOOLS
2000
IEEE
15 years 11 months ago
A Case Study of Framework Design for Horizontal Reuse
In this experience report we present a case study in designing, implementing, and reusing an object-oriented framework for constructing and editing complex search expressions over...
Henrik Bærbak Christensen, Hebrick Rø...
PODS
1999
ACM
95views Database» more  PODS 1999»
15 years 11 months ago
Minimal Data Upgrading to Prevent Inference and Association
Despite advances in recent years in the area of mandatory access control in database systems, today's information repositories remain vulnerable to inference and data associa...
Steven Dawson, Sabrina De Capitani di Vimercati, P...
AB
2007
Springer
15 years 11 months ago
Prefix Reversals on Binary and Ternary Strings
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper...