Sciweavers

595 search results - page 3 / 119
» The Graph Programming Language GP
Sort
View
GECCO
2003
Springer
121views Optimization» more  GECCO 2003»
14 years 24 days ago
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
André Leier, Wolfgang Banzhaf
ICALP
2011
Springer
12 years 11 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
AIIA
1995
Springer
13 years 11 months ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung
GECCO
2004
Springer
155views Optimization» more  GECCO 2004»
14 years 1 months ago
Genetic Network Programming with Reinforcement Learning and Its Performance Evaluation
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
Shingo Mabu, Kotaro Hirasawa, Jinglu Hu
PLDI
2012
ACM
11 years 10 months ago
The implicit calculus: a new foundation for generic programming
Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combi...
Bruno C. d. S. Oliveira, Tom Schrijvers, Wontae Ch...