Paper Info
Title
The Calculus of Self-Modifiable Algorithm Based Evolutionary Computer Network Routing
Abstract
The Calculus of Self-Modifiable Algorithms (CSA) is a universal approach to parallel and intelligent system. Its aim is to integrate different styles of programming and is applied to different areas of future generation computers. Potential applications of CSA include expert systems, machine learning, adaptive systems and many others. The problem of route optimization in computer networks is identified as a task that requires some sort of cost-driven solution that allows for the computation of paths in a network based on experience and inference. The Calculus of Self-Modifiable Algorithm is used to do the specification of this problem by modeling a system of machine learning algorithms that learn proper routing techniques for a particular computer network by incorporating an apportionment of credit system and various rule discovery concepts similar to the learning techniques used in evolutionary computing and symbolic learning.
Year
DOI
Venue
1994
10.1007/3-540-60154-6_56
EvoWorkshops
Keywords
Field
DocType
evolutionary computer network routing,self-modifiable algorithm
Hazy Sighted Link State Routing Protocol,Link-state routing protocol,Computer science,Computer network,Theoretical computer science,Evolutionary programming,Path vector protocol,Expert system,Evolutionary computation,Algorithm,Distance-vector routing protocol,Calculus,Routing protocol
Conference
ISBN
Citations 
PageRank 
3-540-60154-6
1
0.37
References 
Authors
10
2
Name
Order
Citations
PageRank
Davika Seunarine110.37
Eugeniusz Eberbach2388.70