Transparent

moltean

moltean
moltean scribbled: the source code for traceless genetic programming is available at www.tgp.cs.ubbcluj.ro

Using Traceless Genetic Programming for Solving Multiobje...

from moltean

Traceless Genetic Programming (TGP) is a Genetic Programming (GP) variant that is used in the cases where the focus is rather / the output of the program than the program itself. The main di®erence between TGP and other GP techniques is that TGP does not / explicitly store the evolved computer prog...

06/13/2008
moltean
moltean published:

Using Traceless Genetic Programming for Solving Multiobje...

from moltean

Traceless Genetic Programming (TGP) is a Genetic Programming (GP) variant that is used in the cases where the focus is rather / the output of the program than the program itself. The main di®erence between TGP and other GP techniques is that TGP does not / explicitly store the evolved computer prog...

08/24/2007
pandi selvam

pandi selvam scribbled: hai..i want this source code for my project. 05/12/2008

moltean

moltean scribbled: the source code for traceless genetic programming is available at www.tgp.cs.ubbcluj.ro 06/13/2008

moltean
moltean published:

Evolving reversible circuits for the even-parity problem

from moltean

Reversible computing basically means computation with less / or not at all electrical power. Since the standard binary gates are not / usually reversible we use the Fredkin gate in order to achieve reversibility. / An algorithm for designing reversible digital circuits is described in / this paper. T...

08/24/2007
moltean
moltean published:

Improving Multi Expression Programming: An Ascending Trai...

from moltean

Multi Expression Programming is a Genetic Programming variant that uses a linear / representation of individuals. A unique feature of Multi Expression Programming is / its ability of storing multiple solutions of a problem in a single chromosome. In this / paper, we propose and use several technique...

08/24/2007
moltean
moltean published:

EVOLVING WINNING STRATEGIES FOR NIM-LIKE GAMES

from moltean

An evolutionary approach for computing the winning strategy for Nim-like / games is proposed in this paper. The winning strategy is computed by using the / Multi Expression Programming (MEP) technique - a fast and efficient variant of / the Genetic Programming (GP). Each play strategy is represented...

08/24/2007
Gar-Chess-Openings

Gar-Chess-Openings scribbled: Huh, I've never played Nim before! 11/16/2007

moltean
moltean published:

Improving the Search by Encoding Multiple Solutions in a ...

from moltean

We investigate the possibility of encoding multiple solutions of a problem in a single / chromosome. The best solution encoded in an individual will represent (will provide / the fitness of) that individual. In order to obtain some benefits the chromosome / decoding process must have the same comple...

08/24/2007
moltean
moltean published:

Solving Even-Parity Problems using Multi Expression Progr...

from moltean

In this paper, the Multi Expression Programming / (MEP) technique is used for solving even-parity / problems. Numerical experiments show that MEP / outperforms Genetic Programming (GP) with more than / one order of magnitude for the considered test cases.

08/24/2007
moltean
moltean published:

Evolving Evolutionary Algorithms for Function Optimization

from moltean

In this paper, a generational Evolutionary Algorithm (EA) for / function optimization is evolved using the Linear Genetic / Programming (LGP) technique. Numerical experiments show / that the evolved EA significantly outperforms a standard GA.

08/24/2007
moltean
moltean published:

Evolving Evolutionary Algorithms using Multi Expression P...

from moltean

Finding the optimal parameter setting (i.e. the optimal population / size, the optimal mutation probability, the optimal evolutionary / model etc) for an Evolutionary Algorithm (EA) is a difficult task. Instead / of evolving only the parameters of the algorithm we will evolve / an entire EA capable o...

08/24/2007
moltean
moltean published:

Designing Digital Circuits for the Knapsack Problem

from moltean

Multi Expression Programming (MEP) is a Genetic Programming / variant that uses linear chromosomes for solution encoding. A / unique feature of MEP is its ability of encoding multiple solutions of a / problem in a single chromosome. In this paper we use Multi Expression / Programming for evolving dig...

08/24/2007
vara_badita2009

vara_badita2009 scribbled: I want learn evolving digital circuits using MDcartesian genetic programming.kindly help .thankingu 08/07/2009

moltean
moltean published:

Encoding Multiple Solutions in a Linear Genetic Programmi...

from moltean

Linear Genetic Programming (LGP) is a Genetic Programming / variant that uses linear chromosomes for solution encoding. Each / LGP chromosome is a sequence of C language instructions. Each instruction / has a destination variable and several source variables. One of the / variables is usually chosen ...

08/24/2007
simple

simple scribbled: any problem related to power system load flow using genetic algorithn in C language 11/19/2007

moltean
moltean published:

Evolving Crossover Operators for Function

from moltean

A new model for evolving crossover operators for evolutionary / function optimization is proposed in this paper. The model is a hybrid / technique that combines a Genetic Programming (GP) algorithm and a / Genetic Algorithm (GA). Each GP chromosome is a tree encoding a / crossover operator used for f...

08/24/2007
moltean
moltean scribbled: A harware implementation to this problem would be of high interest. I'm wondering how this implementation would compete with the solution provided by a standard computer. Also a comparison with the optical implementation by Fourier transform is of high interest.

Solving the subset-sum problem with a light-based device

from moltean

We propose an optical computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by following the routes given by the connections between nodes. The nodes are connected by arcs in a special way which let...

08/24/2007
moltean
moltean published:

Searching for a practical evidence of the No Free Lunch t...

from moltean

According to the \textit{No Free Lunch} (NFL) theorems all black-box algorithms perform equally well when compared over the entire set of optimization problems. An important problem related to NFL is finding a test problem for which a given algorithm is better than another given algorithm. Of hig...

08/23/2007
moltean
moltean published:

Evolving Evolutionary Algorithms using Linear Genetic Pro...

from moltean

A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization, the Trave...

08/23/2007

+ See more activity

Name
Mihai Oltean
Location
Bio
http://www.cs.ubbcluj.ro/~moltean/
Gender
Male
Website
http://www.cs.ubbcluj.ro/~moltean/optical
Occupation
Researcher
Interests
Unconventional computing, optical solutions to NP-complete problems, Genetic programming, natural... (More)
Lately I've been reading
Optical solutions to NP-complete problems, natural computing
Lately I've been writing
Optical solutions to NP-complete problems such as Hamiltonian path, Exact cover, subset sum.
  • 23 documents
  • 45,414 total reads
  • 34 docs added to reading lists
  • 8 total comments