Sciweavers

2778 search results - page 207 / 556
» Limit complexities revisited
Sort
View
EUROGP
2005
Springer
114views Optimization» more  EUROGP 2005»
16 years 3 days ago
Repeated Patterns in Tree Genetic Programming
We extend our analysis of repetitive patterns found in genetic programming genomes to tree based GP. As in linear GP, repetitive patterns are present in large numbers. Size fair cr...
William B. Langdon, Wolfgang Banzhaf
GCC
2005
Springer
16 years 2 days ago
A Proxy-Based Dynamic Inheritance of Soft-Device
Soft-device is a promising infrastructure of next-generation distributed system. Soft-devices are configurable and adaptive software virtual mechanism, providing services to each o...
Jia Bi, Yanyan Li, Yunpeng Xing, Xiang Li, Xue Che...
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
16 years 2 days ago
A generator for hierarchical problems
We describe a generator for hierarchical problems called the Hierarchical Problem Generator (HPG). Hierarchical problems are of interest since they constitute a class of problems ...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens
ICALP
2005
Springer
16 years 2 days ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
ICALP
2005
Springer
16 years 2 days ago
All Quantum Adversary Methods Are Equivalent
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
Robert Spalek, Mario Szegedy