Results 1  10
of
331
A Study of FixedLength Subset Recombination
 In: Foundations of Genetic Algorithms 4 (R.K. Belew and M.D
, 1997
"... While bitbased, orderbased and realvalued genetic algorithms have been wellstudied in the literature, the fixedlength subset representation has received relatively little attention. We discuss various crossover operators for this representation and the pitfalls associated with each. In partic ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
While bitbased, orderbased and realvalued genetic algorithms have been wellstudied in the literature, the fixedlength subset representation has received relatively little attention. We discuss various crossover operators for this representation and the pitfalls associated with each
2003): A fixedlength subset genetic algorithm for the pmedian problem
 In: Genetic and Evolutionary Computation – GECCO 2003, (E. CantúPaz et al., Eds.). — LNCS
"... Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixedlength subset. Our experimental results on the classical pmedian problem indicate that our method is superior and very close to the optimal solution. 1 FixedLength Subse ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixedlength subset. Our experimental results on the classical pmedian problem indicate that our method is superior and very close to the optimal solution. 1 FixedLength
Ricci Flow with Surgery on ThreeManifolds
"... This is a technical paper, which is a continuation of [I]. Here we verify most of the assertions, made in [I, §13]; the exceptions are (1) the statement that a 3manifold which collapses with local lower bound for sectional curvature is a graph manifold this is deferred to a separate paper, as the ..."
Abstract

Cited by 448 (2 self)
 Add to MetaCart
was considered by Hamilton [H 5,§4,5]; unfortunately, his argument, as written, contains an unjustified statement (RMAX = Γ, on page 62, lines 710 from the bottom), which I was unable to fix. Our approach is somewhat different, and is aimed at eventually constructing a canonical Ricci flow, defined on a largest
Feature Subset Selection and Inductive Logic Programming
, 2002
"... Applicability of ILP to realworld problems is constrained by the high dimensionality of ILP tasks. This paper proposes to reduce the dimensionality of the ILP example space by bringing feature subset selection to the realm of ILP. Seen as a black box, the method reduces ILP examples, in the f ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, in the form of nonrecursive Datalog clauses, by removing literals judged irrelevant for the ILP task at hand. The approach exploits existing AVL feature selection (FS) algorithms by changing the representation from the FOL clausal format to a fixedlength AV format, performing FS on the AV
NearUniversal Cycles for Subsets Exist
, 2008
"... Let S be a cyclic nary sequence. We say that S is a universal cycle ((n,k)Ucycle) for ksubsets of [n] if every such subset appears exactly once contiguously in S, and is a Ucycle packing if every such subset appears at most once. Few examples of Ucycles are known to exist, so the relaxation to pa ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
to packings merits investigation. A family {Sn} of (n,k)Ucycle packings for fixed k is a nearUcycle if the length of Sn is (1 − o(1)) () n k. In this paper we prove that near(n,k)Ucycles exist for all k.
NearUniversal Cycles for Subsets Exist
, 2009
"... Let S be a cyclic nary sequence. We say that S is a universal cycle ((n, k)Ucycle) for ksubsets of [n] if every such subset appears exactly once contiguously in S, and is a Ucycle packing if every such subset appears at most once. Few examples of Ucycles are known to exist, so the relaxation to p ..."
Abstract
 Add to MetaCart
to packings merits investigation. A family {Sn} of (n, k)Ucycle packings for fixed k is a nearUcycle if the length of Sn is (1 − o(1))(nk). In this paper we prove that near(n, k)Ucycles exist for all k.
Whom You Know Matters: Venture Capital Networks and Investment Performance,
 Journal of Finance
, 2007
"... Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company inv ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
Abstract Many financial markets are characterized by strong relationships and networks, rather than arm'slength, spotmarket transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company
Complete Tree Subset Difference Broadcast Encryption Scheme and its Analysis
"... The Subset Difference (SD) method proposed by NaorNaorLotspeich is the most popular broadcast encryption (BE) scheme. It is suitable for realtime applications like PayTV. It has been suggested for use by the AACS standard for digital rights management in BluRay and DVD discs. The SD method assu ..."
Abstract
 Add to MetaCart
. Using this algorithm, we show that for practical values of n and r, the transmission efficiency of the CSD scheme is better than the SD scheme. For n a power of two and a fixed r ≥ 2, we obtain an upper bound on the expected header length and show that this bound is also the limit as n → ∞. 1
Extracting Constrained 2Interval Subsets in 2Interval Sets
, 2007
"... 2interval sets were used in [28,29] for establishing a general representation for macroscopic describers of RNA secondary structures.In this context, we have a 2interval for each legal local fold in a given RNA sequence, and a constrained pattern made of disjoint 2intervals represents a putative ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
is NPcomplete for model R = {<, ≬} even for samelength intervals, and give a fixedparameter tractability result based on the crossing structure of D.
A Note on Minimum Flip Consensus and Maximum Compatible Subset
, 2009
"... Abstract. Minimum Flip Consensus is a supertree method introduced in 2002 [CEFBS02, CDE+03, CEFBS06, CEFBB06, BBT08, KU08], which aims at performing the smallest number of changes (taxa deletion or addition) in a set of clusters so that it becomes compatible with a tree. There exist FPT algorithms [ ..."
Abstract
 Add to MetaCart
[CEFBS02, BBT08, KU08], fixed ratio approximation schemes [CEFBS02], and heuristics [CEFBB06] to solve this problem, which can be coded as an edgeediting problem to transform a bipartite graph into an “Mfree graph ” [CEFBS02]. Maximum Compatible Subset removes the minimum number t of taxa so
Results 1  10
of
331