367 search results - page 71 / 74 » A memetic algorithm for graph coloring |
119
click to vote
SAT
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
125
click to vote
CRYPTO
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
135
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
149
click to vote
KDD
2007
ACM
16 years 3 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...
146
click to vote
KDD
2004
ACM
16 years 3 months ago
2004
ACM
This paper proposes a data mining approach to modeling relationships among categories in image collection. In our approach, with image feature grouping, a visual dictionary is cre...