Sciweavers

1399 search results - page 31 / 280
» New Algorithms for k-Center and Extensions
Sort
View
IJON
2000
80views more  IJON 2000»
15 years 5 months ago
Synthesis approach for bidirectional associative memories based on the perceptron training algorithm
Bidirectional associative memories are being used extensively for solving a variety of problems related to pattern recognition. In the present paper, a new synthesis approach is d...
Ismail Salih, Stanley H. Smith, Derong Liu
ACMSE
2010
ACM
15 years 3 months ago
Generating three binary addition algorithms using reinforcement programming
Reinforcement Programming (RP) is a new technique for automatically generating a computer program using reinforcement learning methods. This paper describes how RP learned to gene...
Spencer K. White, Tony R. Martinez, George L. Rudo...
GD
2004
Springer
15 years 11 months ago
Gravisto: Graph Visualization Toolkit
Gravisto, the Graph Visualization Toolkit, is more than a (Java-based) editor for graphs. It includes data structures, graph algorithms, several layout algorithms, and a graph view...
Christian Bachmaier, Franz-Josef Brandenburg, Mich...
ASIAN
1999
Springer
118views Algorithms» more  ASIAN 1999»
15 years 10 months ago
Asynchronous Links in the PBC and M-Nets
This paper aims at introducing an extension of M-nets, a fully compositional class of high-level Petri nets, and of its low-level counter part, Petri Boxes Calculus (PBC). We intro...
Hanna Klaudel, Franck Pommereau
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
15 years 9 months ago
FSMTree: An Efficient Algorithm for Mining Frequent Temporal Patterns
Research in the field of knowledge discovery from temporal data recently focused on a new type of data: interval sequences. In contrast to event sequences interval sequences contai...
Steffen Kempe, Jochen Hipp, Rudolf Kruse