Sciweavers

1088 search results - page 31 / 218
» Independence of Negative Constraints
Sort
View
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
14 years 11 months ago
Efficient incremental constrained clustering
Clustering with constraints is an emerging area of data mining research. However, most work assumes that the constraints are given as one large batch. In this paper we explore the...
Ian Davidson, S. S. Ravi, Martin Ester
CP
2004
Springer
14 years 4 months ago
The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting
The contribution of this paper is in demonstrating the impact of AND/OR search spaces view on solutions counting. In contrast to the traditional (OR) search space view, the AND/OR ...
Rina Dechter, Robert Mateescu
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
14 years 3 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
14 years 9 days ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...
EMO
2009
Springer
174views Optimization» more  EMO 2009»
14 years 5 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck