3422 search results - page 139 / 685 » Random Subset Optimization |
145
click to vote
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
180
click to vote
COMBINATORICA
2011
14 years 4 months ago
2011
Thomassen [Combinatorica 24 (2004), 699–718] proved that a 2–connected, compact, locally connected metric space is homeomorphic to a subset of the sphere if and only if it doe...
129
click to vote
NIPS
2003
15 years 6 months ago
2003
A novel approach to combining clustering and feature selection is presented. It implements a wrapper strategy for feature selection, in the sense that the features are directly se...
138
click to vote
LATIN
2004
Springer
15 years 10 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
128
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...