Login | Signup | Help
Transparent

Recent Documents Rss

Preview Star_faded

Using Traceless Genetic Programming for Solving Multiobjective Optimization problems

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 programs. Two genetic operators are used in conjunction with TGP: crossover and insertion. In this pape...
  • Pdf_16x16 19 Pages
  • 719 views
  • 2 Comments
Preview Star_faded

Evolving reversible circuits for the even-parity problem

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. The algorithm is based on Multi Expression Programming (MEP), a Genetic Programming variant with a l...
  • Pdf_16x16 10 Pages
  • 394 views
  • 0 Comments
Preview Star_faded

Improving Multi Expression Programming: An Ascending Trail from Sea-Level Even-3-Parity Problem to A

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 techniques for improving the search performed by Multi Expression Programming. Some of the most important im...
  • Pdf_16x16 36 Pages
  • 289 views
  • 0 Comments
Preview Star_faded

EVOLVING WINNING STRATEGIES FOR NIM-LIKE GAMES

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 by a mathematical expression that contains mathematical operators (such as +, -, *, mod, div, and...
  • Pdf_16x16 10 Pages
  • 1474 views
  • 1 Comment
Preview Star_faded

Improving the Search by Encoding Multiple Solutions in a Chromosome

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 complexity as in the case of a single solution in a chromosome. Three Genetic Programming techniques are ...
  • Pdf_16x16 36 Pages
  • 222 views
  • 0 Comments
Preview Star_faded

Solving Even-Parity Problems using Multi Expression Programming

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.
  • Pdf_16x16 4 Pages
  • 444 views
  • 0 Comments
Preview Star_faded

Evolving Evolutionary Algorithms for Function Optimization

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.
  • Pdf_16x16 4 Pages
  • 651 views
  • 0 Comments
Preview Star_faded

Evolving Evolutionary Algorithms using Multi Expression Programming

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 of solving a particular problem. For this purpose the Multi Expression Programming (MEP) technique i...
  • Pdf_16x16 8 Pages
  • 437 views
  • 0 Comments
Preview Star_faded

Designing Digital Circuits for the Knapsack Problem

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 digital circuits for a well-known NP-Complete problem: the knapsack (subset sum) problem. Numerical ex...
  • Pdf_16x16 8 Pages
  • 1242 views
  • 1 Comment
Preview Star_faded

Encoding Multiple Solutions in a Linear Genetic Programming Chromosome

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 to provide the output of the program. In this paper, we enrich the LGP technique by allowing it to ...
  • Pdf_16x16 8 Pages
  • 494 views
  • 2 Comments

See all 23 documents

Collections

No collections

Comments

Comment on Using Traceless Genetic Programming for Solving Multiobjective Optimization problems
Posted on June 13, 2008

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

Comment on Solving the subset-sum problem with a light-based device
Posted on August 24, 2007

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.

moltean

Search within moltean's documents:

Page_white_text 23 Documents

Group 12199 Viewers

Thumb_up 12 Likes

User_add Add moltean to friends

Basic Info

Name:

Mihai Oltean

Gender:

Male

Website:

http://www.c...
Personal Info

Occupation:

Researcher

Interests:

Unconventional computing, optical solutions to NP-complete problems, Genetic programming, natural computing, light-based devices
   

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.
   

About me:

http://www.cs.ubbcluj.ro/~moltean/

Friends See all 1 friend

8zgk1pweldgc5-tiny

Trip

Groups See all 1 group

3jr5t7esh802s-tiny

Natural Computing