While bit-based, order-based and real-valued genetic algorithms have been wellstudied in the literature, the fixed-length subset representation has received relatively little attention. We discuss various crossover operators for this representation and the pitfalls associated with each

Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the classical p-median problem indicate that our method is superior and very close to the optimal solution. 1 Fixed-Length

was considered by Hamilton [H 5,§4,5]; unfortunately, his argument, as written, contains an unjustified statement (RMAX = Γ, on page 62, lines 7-10 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

, 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 fixed-length AV format, performing FS on the AV

to packings merits investigation. A family {Sn} of (n,k)-Ucycle packings for fixed k is a near-Ucycle 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.

to packings merits investigation. A family {Sn} of (n, k)-Ucycle packings for fixed k is a near-Ucycle if the length of Sn is (1 − o(1))(nk). In this paper we prove that near-(n, k)-Ucycles exist for all k.

Abstract Many financial markets are characterized by strong relationships and networks, rather than arm's-length, spot-market transactions. We examine the performance consequences of this organizational choice in the context of relationships established when VCs syndicate portfolio company

. 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

is NP-complete for model R = {<, ≬} even for same-length intervals, and give a fixed-parameter tractability result based on the crossing structure of D.

[CEFBS02, BBT08, KU08], fixed ratio approximation schemes [CEFBS02], and heuris-tics [CEFBB06] to solve this problem, which can be coded as an edge-editing problem to transform a bipartite graph into an “M-free graph ” [CEFBS02]. Maximum Compatible Subset removes the min-imum number t of taxa so