435 search results - page 31 / 87 » Partitioning Search Spaces of a Randomized Search |
80
Voted
DAC
2004
ACM
15 years 10 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
PVLDB
2010
14 years 8 months ago
2010
Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each ...
CIDU
2010
14 years 7 months ago
2010
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
82
Voted
CVPR
2008
IEEE
15 years 4 months ago
2008
IEEE
We propose a new method to partition an unlabeled dataset, called Discriminative Context Partitioning (DCP). It is motivated by the idea of splitting the dataset based only on how...