« Stochastic Problem Solving by Local Computation based on Self-organization Paradigm | Main | Dynamic Graph Coloring using CCM -- A Model for Emergent Computation »

Symbolic Random Tunneling Based on Composing Production Rules -- Constraint Satisfaction and Optimization Using Computation Model CCM --

Kanada, Y., SICE 14th SIG Systems Engineering Note, The Society of Instrument and Control Engineers, 45-52, 1994, Published by SICE.

[ 日本語のページ ]
[ Paper PDF file (in Japanese) ] [ Paper postscript file: Part 1, Part 2 (in Japanese) ]

[English abstract is not available.]

Introduction to this research theme: CCM: Chemical-Computation Model

Keywords: CCM, Constraint satisfaction problem, Combinatorial optimization, Emergent Computation, Randomized computation, Randomized problem solving, Rule-based computation, Rule-based problem solving, Tunneling

TrackBack

TrackBack URL for this entry:
http://www.kanadas.com/mt/mt-tb.cgi/147

Post a comment

About

This page contains a single entry from the subsite posted on April 1, 1994 12:00 AM.

The previous post in this subsite was Stochastic Problem Solving by Local Computation based on Self-organization Paradigm.

The next post in this subsite is Dynamic Graph Coloring using CCM -- A Model for Emergent Computation.

Many more can be found on the main index page or by looking through the archives.

(C) Copyright 2007 by Yasusi Kanada
Powered by
Movable Type 3.36