Sciweavers

622 search results - page 83 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
14 years 7 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
LPNMR
1997
Springer
14 years 5 days ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
COR
2011
13 years 3 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
LPNMR
2009
Springer
14 years 2 months ago
Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs
Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility of field-programmable devices to customize architectures for paralle...
Harold Ishebabi, Philipp Mahr, Christophe Bobda, M...
MP
2008
99views more  MP 2008»
13 years 8 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey