Sciweavers

79 search results - page 8 / 16
» A Recurrent Neural Network for Solving the Shortest Path Pro...
Sort
View

Lecture Notes
443views
15 years 5 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
NEUROSCIENCE
2001
Springer
13 years 12 months ago
Finite-State Computation in Analog Neural Networks: Steps towards Biologically Plausible Models?
Abstract. Finite-state machines are the most pervasive models of computation, not only in theoretical computer science, but also in all of its applications to real-life problems, a...
Mikel L. Forcada, Rafael C. Carrasco
COR
2008
142views more  COR 2008»
13 years 7 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
OTM
2010
Springer
13 years 5 months ago
Towards Evaluating GRASIM for Ontology-Based Data Matching
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
Yan Tang
EOR
2006
73views more  EOR 2006»
13 years 7 months ago
Path relinking and GRG for artificial neural networks
Artificial neural networks (ANN) have been widely used for both classification and prediction. This paper is focused on the prediction problem in which an unknown function is appr...
Abdellah El-Fallahi, Rafael Martí, Leon S. ...