Using Recurrent Neural Networks to Learn the Structure of Interconnection Networks

 GOUDREAU Mark W.
 University of Central Florida

 LEE GILES C.
 NEC Research Institute, Inc. and UMIACS, University of Maryland
Search this Article
Author(s)

 GOUDREAU Mark W.
 University of Central Florida

 LEE GILES C.
 NEC Research Institute, Inc. and UMIACS, University of Maryland
Journal

 Neural networks : the official journal of the International Neural Network Society

Neural networks : the official journal of the International Neural Network Society 8(5), 793804, 19950701
References: 45

1
 <no title>

ANDREWS R.
A survey and critique of techniques for extracting rules from trained artificial neural networks, 1995
Cited by (1)

2
 <no title>

CLOUSE D.
Learning large De Bruijn automata with feedforward neural networks, 1994
Cited by (1)

3
 A neural network model for traffic controls in multistage interconnection networks

FUNABIKI N.
Proceedings of the International Joint Conference on Neural Networks 1991 A898, 1991
Cited by (1)

4
 Extracting and learning an unknown grammar with recurrent neural networks

GILES C. L.
Advances in neural information processing systems 4, 317324, 1992
Cited by (1)

5
 Discovering the structure of a selfrouting interconnection network with a recurrent neural network

GOUDREAU M.
International Workshop on Applications of Neural Networks to Telecommunications, 5259, 1993
Cited by (1)

6
 Neural network applications for interconnection networks

GOUDREAU M. W.
Ph. D. thesis, Princeton University, 1993
Cited by (1)

7
 Routing in random multistage interconnection networks : Comparing exhaustive search, greedy and neural network approaches

GOUDREAU M. W.
International Journal of Neural Systems 3, 125142, 1992
Cited by (1)

8
 A neural network approach to the setup of the Benes switch

HAKIM N. Z.
Infocom 90, 397402, 1990
Cited by (1)

9
 <no title>

HOPCROFT J. E.
Introduction to Automata Theory,Languages and Computation, 1979
Cited by (66)

10
 Cryptographic limitations on learning boolearn formulae and finite automata

KEARNS M.
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
Cited by (1)

11
 <no title>

KOHAVI Z.
Switching and finite automata theory, 1978
Cited by (4)

12
 Random DFA's can be approximately learned from sparse uniform examples

LANG K.
Proceedings of the Fifth ACM Workshop on Computational Learning Theory, 4552, 1992
Cited by (1)

13
 A neural network solution for call routing with preferential call placement

MELSA P. J. W.
Proceedings of the 1990 Global Telecommunications Conference, 13771382, 1990
Cited by (1)

14
 A neural network solution for routing in three stage interconnection networks

MELSA P. J. W.
Proceedings of the 1990 International Symposium on Circuits and Systems, 483486, 1990
Cited by (1)

15
 The minimum DFA consistency problem cannot be aproximated within any polynomial

PITT L.
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
Cited by (1)

16
 A new approach to unsupervised learning in deterministic environments

RIVEST R. L.
Proceedings of the Fourth International Workshop on Machine Learning, 1987
Cited by (1)

17
 Diversitybased inference of finite automata

SCHAPIRE R. E.
Master's thesis, Massachusetts Institute of Technology, 1988
Cited by (1)

18
 <no title>

SIEGEL H. J.
Interconnection networks for large scale parallel processing, 1990
Cited by (2)

19
 An artificial hysteresis binary neuron : A model suppressing the oscillatory behavior of neural dynamics

TAKEFUJI Y.
Biological Cybernetics 64, 353356, 1991
Cited by (1)

20
 Neural network implementation of the shortest path algorithm for traffic routing in communication networks

THOMOPOULOS S. C. A.
Proceedings of the International Joint Conference on Neural Networks 1991, 26932702, 1991
Cited by (1)

21
 <no title>

TRAKHTENBROT B.
Finite automata : behavior and synthesis, 1973
Cited by (1)

22
 On the Complexity of Minimum Inference of Regular Sets

ANGLUIN D.
Information and Control 39, 337350, 1978
Cited by (5)

23
 Neural networks for switching

BROWN T. X.
IEEE Communications Magazine 27, 7281, 1989
Cited by (1)

24
 Neural network design of a Banyan network controller

BROWN T. X.
IEEE Journal on Selected Areas of Communication 8, 14281438, 1990
Cited by (1)

25
 Finite state automata and simple recurrent networks

CLEEREMANS A.
Neural Computation 1, 372381, 1989
DOI Cited by (26)

26
 Comparisons of seven neural network models on traffic control problems in multistage interconnection networks

FUNABIKI N.
IEEE Trans. Computers 42(4), 497501, 1993
Cited by (2)

27
 Extraction, insertion, and refinement of symbolic rules in driven recurrent networks

GILES C.
Connection Science 5(3&4), 307328, 1993
Cited by (2)

28
 Pruning recurrent neural networks for improved generalization performance

GILES C.
IEEE Transactions on Neural Networks 5, 848851, 1994
Cited by (6)

29
 Learnign and extracting finite state automata with secondorder recurrent neural networks

GILES C. L.
Neural Computation 4(4), 393405, 1992
DOI Cited by (18)

30
 Complexity of automaton identification from given data

GOLD E. M.
Inf. * Control 37(3), 302320, 1978
DOI Cited by (16)

31
 FirstOrder Versus SecondOrder SingleLayer Recurrent Neural Networks

GOUDREAU M.
IEEE Neural Networks 5(3), 511111, 1994
Cited by (7)

32
 Coevolving Parasites Improve Simulated Evolution as an Optimization Procedure

W. D. Hillis
Phisica D 42, 228234, 1990
Cited by (6)

33
 Neural networks for routing of communication networks with unreliable components

LEE S. L.
IEEE Trans. Neural Networks 4, 854863, 1993
Cited by (2)

34
 Using knowledgebased neural networks to improve algorithms : Refining the ChouFasman algorithm for protein folding

MACLIN R.
Machine Learning 11(23), 195215, 1993
DOI Cited by (2)

35
 FirstOrder Recurrent Neural Networks and Deterministic Finite State Automata

MANOLIOS P.
Neural Computation 6, 11551173, 1994
DOI Cited by (6)

36
 A neural net arbitrator for large crossbar packetswitches

MARRAKCHI A. M.
IEEE Trans. on Circuits and Systems 36(7), 10391041, 1989
Cited by (6)

37
 Experimental comparison of the effect of order in recurrent neural networks

MILLER C.
International Journal of Pattern Recognition and Artificial Intelligence 7, 849872, 1993
Cited by (1)

38
 Discovering the structure of a reactive environment by exploration

MOZER M. C.
Neural Comput. 2(4), 447457, 1990
DOI Cited by (4)

39
 SLUG : A connectionist architecture for inferring the structure of finitestate environments

MOZER M. C.
Machine Learning 7, 139160, 1991
DOI Cited by (1)

40
 The induction of dynamical recognizers

POLLACK J. B.
Machine Learning 7, 227252, 1991
DOI Cited by (21)

41
 Diversitybased inference of finite automata

RIVEST R. L.
Proceedings of the TwentyEighth Annual Symposium on Foundations of Computer Science, 7887, 1987
Cited by (1)

42
 Neural network architecture for crossbar switch control

TROUDET T. P.
IEEE Trans. on Circuits and Systems 38(1), 4256, 1991
Cited by (6)

43
 Induction of FiniteState Languages Using SecondOrder Recurrent Networks

WATROUS R. L.
Neural Computation 4, 406414, 1995
DOI Cited by (7)

44
 A learning algorithm for continually running fully recurrent neural networks

WILLIAMS R. J.
Neural Computation 1(2), 270280, 1989
DOI Cited by (77)

45
 Learning finite state machines with selfclustering recurrent networks

ZENG Z.
Neural Computation 5, 976990, 1993
DOI Cited by (9)