Sciweavers

639 search results - page 11 / 128
» Dominance Constraints with Set Operators
Sort
View
CP
2001
Springer
13 years 12 months ago
Partially Ordered Constraint Optimization Problems
The Constraint Problems usually addressed fall into one of two models: the Constraint Satisfaction Problem (CSP) and the Constraint Optimization Problem (COP). However, in many rea...
Marco Gavanelli
SIGMOD
2009
ACM
191views Database» more  SIGMOD 2009»
14 years 7 months ago
Scalable skyline computation using object-based space partitioning
The skyline operator returns from a set of multi-dimensional objects a subset of superior objects that are not dominated by others. This operation is considered very important in ...
Shiming Zhang, Nikos Mamoulis, David W. Cheung
IPMU
2010
Springer
13 years 11 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin
ORL
2011
12 years 10 months ago
A note on the MIR closure and basic relaxations of polyhedra
Anderson, Cornu´ejols and Li (2005) show that for a polyhedral mixed integer set defined by a constraint system
Sanjeeb Dash, Oktay Günlük, Christian Ra...
CSL
2010
Springer
13 years 8 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter