Sciweavers

7988 search results - page 1318 / 1598
» A Useful Undecidable Theory
Sort
View
TIT
1998
127views more  TIT 1998»
15 years 6 months ago
On a New Class of Codes for Identifying Vertices in Graphs
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...
TNN
1998
111views more  TNN 1998»
15 years 6 months ago
Asymptotic distributions associated to Oja's learning equation for neural networks
— In this paper, we perform a complete asymptotic performance analysis of the stochastic approximation algorithm (denoted subspace network learning algorithm) derived from Oja’...
Jean Pierre Delmas, Jean-Francois Cardos
SLOGICA
2002
74views more  SLOGICA 2002»
15 years 6 months ago
Transfers between Logics and their Applications
In this paper, logics are conceived as two-sorted first-order structures, and we argue that this broad definition encompasses a wide class of logics with theoretical interest as w...
Marcelo E. Coniglio, Walter Alexandre Carnielli
TEC
2002
88views more  TEC 2002»
15 years 6 months ago
Parallelism and evolutionary algorithms
Abstract--This paper contains a modern vision of the parallelization techniques used for evolutionary algorithms (EAs). The work is motivated by two fundamental facts: first, the d...
Enrique Alba, Marco Tomassini
TSMC
2002
156views more  TSMC 2002»
15 years 6 months ago
Varieties of learning automata: an overview
Automata models of learning systems introduced in the 1960s were popularized as learning automata (LA) in a survey paper in 1974 [1]. Since then, there have been many fundamental a...
M. A. L. Thathachar, P. Shanti Sastry
« Prev « First page 1318 / 1598 Last » Next »