1628 search results - page 219 / 326 » Partitioning Sets with Genetic Algorithms |
ISAAC
2005
Springer
14 years 3 months ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
EVOW
2004
Springer
14 years 3 months ago
2004
Springer
In sequential, deterministic, non-redundant search the algorithm permutes a test function to obtain the search result. The mapping from test functions to search results is a one-to...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
CDC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Dynamic Bayesian Networks (DBNs) provide a systematic framework for robust online monitoring of dynamic systems. This paper presents an approach for increasing the efficiency ...
DAC
1998
ACM
14 years 2 months ago
1998
ACM
Approximate reachability techniques trade o accuracy with the capacity to deal with bigger designs. Cho et al 3 proposed approximate FSM traversal algorithms over a partition of t...