241 search results - page 26 / 49 » Constraint Handling in Genetic Algorithms: The Set Partition... |
AISC
2006
Springer
13 years 11 months ago
2006
Springer
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Conditional random fields(CRFs) are a class of undirected graphical models which have been widely used for classifying and labeling sequence data. The training of CRFs is typicall...
ISPD
1999
ACM
13 years 12 months ago
1999
ACM
We study alternatives to FM-based partitioning in the context of end-case processing for top-down standard-cell placement. The primary motivation is that small partitioning instan...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...