Sciweavers

1996 search results - page 110 / 400
» Financial Theory 2
Sort
View
JGT
2010
93views more  JGT 2010»
13 years 8 months ago
An asymptotic version of a conjecture by Enomoto and Ota
. Dirac. Some theorems on abstract graphs. Proc. London Math. Soc. (3), 2:69–81, 1952. [2] Hikoe Enomoto and Katsuhiro Ota. Partitions of a graph into paths with prescribed endve...
Colton Magnant, Daniel M. Martin
GECCO
2008
Springer
126views Optimization» more  GECCO 2008»
13 years 11 months ago
The impact of population size on code growth in GP: analysis and empirical validation
The crossover bias theory for bloat [18] is a recent result which predicts that bloat is caused by the sampling of short, unfit programs. This theory is clear and simple, but it ...
Riccardo Poli, Nicholas Freitag McPhee, Leonardo V...
JGT
2007
130views more  JGT 2007»
13 years 10 months ago
Vertex partitions and maximum degenerate subgraphs
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
Martín Matamala
STOC
2009
ACM
143views Algorithms» more  STOC 2009»
14 years 10 months ago
Affine dispersers from subspace polynomials
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
Eli Ben-Sasson, Swastik Kopparty
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 10 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang