Sciweavers

14779 search results - page 235 / 2956
» On Ultrametric Algorithmic Information
Sort
View
FLAIRS
2004
15 years 8 months ago
ABSURDIST II: A Graph Matching Algorithm and its Application to Conceptual System Translation
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...
Ying Feng, Robert L. Goldstone, Vladimir Menkov
IPM
2006
94views more  IPM 2006»
15 years 6 months ago
Binary Pathfinder: An improvement to the Pathfinder algorithm
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...
IEEECIT
2010
IEEE
15 years 5 months ago
Non-recursive Algorithm of Tower of Hanoi Problem
—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...
Fuwan Ren, Qifan Yang, Jiexin Zheng, Hui Yan
CSFW
2010
IEEE
15 years 10 months ago
Required Information Release
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...
Stephen Chong
ICCBR
2009
Springer
16 years 1 months ago
S-Learning: A Model-Free, Case-Based Algorithm for Robot Learning and Control
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...
Brandon Rohrer