86 search results - page 6 / 18 » Polynomial Constraints for Sets with Cardinality Bounds |
115
click to vote
VL
2000
IEEE
15 years 4 months ago
2000
IEEE
SD2 is a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They augment the systems of Venn-Peirce ...
115
Voted
ACID
2006
15 years 1 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
120
click to vote
SDM
2011
SIAM
14 years 2 months ago
2011
SIAM
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
151
click to vote
CCA
2009
Springer
15 years 4 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...