4066 search results - page 145 / 814 » Almost Complete Sets |
157
click to vote
ICFCA
2005
Springer
15 years 12 months ago
2005
Springer
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
169
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
185
click to vote
STRINGOLOGY
2004
15 years 7 months ago
2004
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
174
click to vote
ACTA
2008
15 years 6 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
222
click to vote
PRL
2002
15 years 6 months ago
2002
This paper presents a learning system that uses genetic programming as a tool for automatically inferring the set of classification rules to be used during a preclassification sta...