ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
Vicente P. Guerrero Bote, Felipe Zapico-Alonso, Ma...
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
Abstract—Many computer systems have a functional requirement to release information. Such requirements are an important part of a system’s information security requirements. Cu...
A model-free, case-based learning and control algorithm called S-learning is described as implemented in a simulation of a light-seeking mobile robot. S-learning demonstrated learn...