Sciweavers

446 search results - page 53 / 90
» A Combinatorial Theorem for Trees
Sort
View
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 7 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
AML
2011
204views Mathematics» more  AML 2011»
14 years 6 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
CEC
2008
IEEE
15 years 6 months ago
Geometric PSO + GP = Particle Swarm Programming
—Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both conti...
Julian Togelius, Renzo De Nardi, Alberto Moraglio
COCOON
2006
Springer
15 years 3 months ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
EUROGP
2010
Springer
172views Optimization» more  EUROGP 2010»
15 years 3 months ago
Geometric Differential Evolution on the Space of Genetic Programs
Abstract. Geometric Differential Evolution (GDE) is a very recently introduced formal generalization of traditional Differential Evolution (DE) that can be used to derive specific ...
Alberto Moraglio, Sara Silva