628 search results - page 84 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
130
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
126
click to vote
GECCO
2009
Springer
15 years 9 months ago
2009
Springer
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
127
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
139
click to vote
NETGAMES
2006
ACM
15 years 9 months ago
2006
ACM
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
135
click to vote
CPM
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...