An atlas of edge-reversal dynamics

An Atlas of Edge-Reversal Dynamics

Volumn , Issue , 2000, Pages 1-372

  Barbosa, Valmir C ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037944707     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (66)

1. Attiya, H., H. Shachnai, and T. Tamir (1999). Local labeling and resource allocation using preprocessing. SIAM J. on Computing 28, 1397–1413.
2. Awerbuch, B. (1985). Complexity of network synchronization. J. of the ACM 32, 804–823.
3. Barbosa, V. C. (1986). Concurrency in systems with neighborhood constraints. Ph.D. dissertation, Computer Science Department, University of California, Los Angeles, CA.
4. Barbosa, V. C. (1993). Massively Parallel Models of Computation: Distributed Parallel Processing in Artificial Intelligence and Optimization. Ellis Horwood, Chichester, UK.
5. Barbosa, V. C. (1996). An Introduction to Distributed Algorithms. The MIT Press, Cambridge, MA.
6. Barbosa, V. C., M. R. F. Benevides, and F. M. G. Françca (2000). Sharing resources at nonuniform access rates. Theory of Computing Systems, to appear.
7. Barbosa, V. C., and E. Gafni (1989). A distributed implementation of simulated annealing. J. of Parallel and Distributed Computing 6, 411–434.
8. Barbosa, V. C., and E. Gafni (1989). Concurrency in heavily loaded neighborhood-constrained systems. ACM Trans. on Programming Languages and Systems 11, 562–584.
9. Barbosa, V. C., and P. M. V. Lima (1990). On the distributed parallel simulation of Hopeld's neural networks. Software Practice and Experience 20, 967–983.
10. Barbosa, V. C., and J. L. Szwarcter (1999). Generating all the acyclic orientations of an undirected graph. Information Processing Letters 72, 71–74.
11. Berge, C. (1976). Graphs and Hypergraphs. North-Holland, Amsterdam, The Netherlands.
12. Bertsekas, D. P., and J. N. Tsitsiklis (1989). Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Clis, NJ.
13. Bertsekas, D. P., and J. N. Tsitsiklis (1991). Some aspects of parallel and distributed iterative algorithms–a survey. Automatica 27, 3–21.
14. Besag, J. (1974). Spatial interaction and the statistical analysis of lattice systems. J. of the Royal Statistical Society, Series B 36, 192–236.
15. Bondy, J. A., and U. S. R. Murty (1976). Graph Theory with Applications. North-Holland, New York, NY.
16. Brilman, M., and J.-M. Vincent (1998). On the estimation of the throughput for a class of stochastic resources sharing systems. Mathematics of Operations Research 23, 305–321.
17. Calabrese, A., and F. M. G. Françca (1994). A randomised distributed primer for the updating control of ANNs. In Proc. of the International Conference on Artificial Neural Networks, 585–588. Springer-Verlag, New York, NY.
18. Cameron, R. D., C. J. Colbourn, R. C. Read, and N. C. Wormald (1985). Cataloguing the graphs on 10 vertices. J. of Graph Theory 9, 551–562.
19. Chandy, K. M., and J. Misra (1984). The drinking philosophers problem. ACM Trans. on Programming Languages and Systems 6, 632–646.
20. Chandy, K. M., and J. Misra (1988). Parallel Program Design: a Foundation. Addison-Wesley, Reading, MA.
21. Clarke, F. H., and R. E. Jamison (1976). Multicolorings, measures and games on graphs. Discrete Mathematics 14, 241–245.
22. Cooper, G. F. (1990). The computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence 42, 393–405.
23. d'Acierno, A., and R. Vaccaro (1994). On parallelizing recursive neural networks on coarse-grained parallel computers: a general algorithm. Parallel Computing 20, 245–256.
24. Dijkstra, E. W. (1971). Hierarchical ordering of sequential processes. Acta Informatica 1, 115–138.
25. Eizirik, L. M. R., V. C. Barbosa, and S. B. T. Mendes (1993). A Bayesian-network approach to lexical disambiguation. Cognitive Science 17, 257–283.
26. Even, S., and S. Rajsbaum (1997). The use of a synchronizer yields the maximum computation rate in distributed networks. Theory of Computing Systems 30, 447–474.
27. Felten, E., S. Karlin, and S. W. Otto (1985). The traveling salesman problem on a hypercubic, MIMD computer. In Proc. of the International Conference on Parallel Processing, 6–10. IEEE Computer Society Press, Washington, DC.
28. Françca, F. M. G. (1991). A self-organizing updating network. In Proc. of the International Conference on Artificial Neural Networks, 1349– 1352. North-Holland, New York, NY.
29. Françca, F. M. G. (1992). Distributed generation of synchronous, asynchronous and partially synchronous/asynchronous updating dynamics by a self-organizing oscillatory network. In Proc. of the International Conference on Artificial Neural Networks, 1057–1061. North-Holland, New York, NY.
30. Françca, F. M. G. (1993). Scheduling weightless systems with self-timed Boolean networks. In Proc. of the Workshop on Weightless Neural Networks, 87–92.
31. Françca, F. M. G. (1994). Neural networks as neighbourhood-constrained systems. Ph.D. thesis, Department of Electrical and Electronic Engineering, Imperial College of Science, Technology, and Medicine, London, UK.
32. Gafni, E. M., and D. P. Bertsekas (1981). Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Trans. on Communications 29, 11–18.
33. Garey, M. R., and D. S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, NY.
34. Geman, S., and D. Geman (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans. on Pattern Analysis and Machine Intelligence 6, 721–741.
35. Greening, D. R. (1990). Parallel simulated annealing techniques. Physica D 42, 293–306.
36. Greening, D. R. (1991). Asynchronous parallel simulated annealing. In L. Nadel and D. L. Stein (Eds.), 1990 Lectures in Complex Systems, 497–507. Addison-Wesley, Redwood City, CA.
37. Grieath, D. (1976). Introduction to random fields. In J. G. Kennedy, J. L. Snell, and A. W. Knapp (Eds.), Denumerable Markov Chains, 425–458. Springer-Verlag, New York, NY.
38. Grimmett, G. R. (1973). A theorem about random felds. Bull. of the London Mathematical Society 5, 81–84.
39. Grfiotschel, M., L. Lovfiasz, and A. Schrijver (1981). The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169–197.
40. Hertz, J., A. Krogh, and R. G. Palmer (1991). Introduction to the Theory of Neural Computation. Addison-Wesley, Redwood City, CA.
41. Hinton, G. E., T. J. Sejnowski, and D. H. Ackley (1984). Boltzmann machines: constraint satisfaction networks that learn. Technical report CMU-CS-84-119, Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA.
42. Hopgield, J. J. (1982). Neural networks and physical systems with emergent collective computational abilities. Proc. of the National Academy of Sciences USA 79, 2554–2558.
43. Hrycej, T. (1990). Gibbs sampling in Bayesian networks. Artificial Intelligence 46, 351–363.
44. Isham, V. (1981). An introduction to spatial point processes and Markov random fields. International Statistical Review 49, 21–43.
45. Kagno, I. N. (1946). Linear graphs of degree 6 and their groups. American J. of Mathematics 68, 505–520.
46. Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher (Eds.), Complexity of Computer Computations, 85–103. Plenum Press, New York, NY.
47. Kinderman, R., and J. L. Snell (1980). Markov Random Fields and their Applications. American Mathematical Society, Providence, RI.
48. Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi (1983). Optimization by simulated annealing. Science 220, 671–680.
49. Malka, Y., and S. Rajsbaum (1992). Analysis of distributed algorithms based on recurrence relations (preliminary version). In Proc. of the (1991) International Workshop on Distributed Algorithms, 242–253. Springer-Verlag, New York, NY.
50. Malka, Y., S. Moran, and S. Zaks (1993). A lower bound on the period length of a distributed scheduler. Algorithmica 10, 383–398.
51. McKay, B. D. (1998). Isomorph-free exhaustive generation. J. of Algorithms 26, 306–324.
52. Moussouris, J. (1974). Gibbs and Markov random systems with constraints. J. of Statistical Physics 10, 11–33.
53. Pearl, J. (1986). Fusion, propagation and structuring in belief networks. Artificial Intelligence 29, 241–288.
54. Pearl, J. (1987). Evidential reasoning using stochastic simulation of causal models. Artificial Intelligence 32, 245–257.
55. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA.
56. Prisner, E. (1995). Graph Dynamics. Longman, New York, NY.
57. Rajsbaum, S., and M. Sidi (1994). On the performance of synchronized programs in distributed networks with random processing times and transmission delays. IEEE Trans. on Parallel and Distributed Systems 5, 939–950.
58. Scheinerman, E. R., and D. H. Ullman (1997). Fractional Graph Theory: A Rational Approach to the Theory of Graphs. Wiley, New York, NY.
59. Schuster, H. G. (1995). Deterministic Chaos: An Introduction. VCH, Weinheim, Germany.
60. Spitzer, F. (1971). Markov random fields and Gibbs ensembles. American Mathematical Monthly 78, 142–154.
61. Squire, M. B. (1998). Generating the acyclic orientations of a graph. J. of Algorithms 26, 275–290.
62. Stahl, S. (1976). n-tuple colorings and associated graphs. J. of Combinatorial Theory, Series B 20, 185–203.
63. Stanley, R. P. (1973). Acyclic orientations of graphs. Discrete Mathematics 5, 171–178.
64. Trivedi, K. S. (1982). Probability & Statistics with Reliability, Queuing, and Computer Science Applications. Prentice-Hall, Englewood Clifis, NJ.
65. Vo, K.-P. (1987). Graph colorings and acyclic orientations. Linear and Multilinear Algebra 22, 161–170.
66. Wuensche, A., and M. Lesser (1992). The Global Dynamics of Cellular Automata: An Atlas of Basin of Attraction Fields of One-Dimensional Cellular Automata. Addison-Wesley, Reading, MA.