Sciweavers

1977 search results - page 183 / 396
» The satisfactory partition problem
Sort
View
CP
2004
Springer
15 years 12 months ago
Streamlined Constraint Reasoning
Abstract. We introduce a new approach for focusing constraint reasoning using so-called streamlining constraints. Such constraints partition the solution space to drive the search ...
Carla P. Gomes, Meinolf Sellmann
FLAIRS
1998
15 years 8 months ago
Static Classification Schemes for an Object System
Instance (or object) classification in a knowledgebase managementsystem is the very same problem as view determination in an object DBMS,whereviewsare subsets of classes intension...
Ana Simonet, Michel Simonet, Cyr Gabin Bassolet, X...
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 6 months ago
Relaxation-based coarsening and multiscale graph organization
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
Dorit Ron, Ilya Safro, Achi Brandt
DAM
2006
79views more  DAM 2006»
15 years 6 months ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean
ML
2006
ACM
15 years 6 months ago
A Unified View on Clustering Binary Data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li