The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Arthur M. Farley: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. John S. Anderson, Arthur M. Farley
    Plan Abstraction Based on Operator Generalization. [Citation Graph (1, 0)][DBLP]
    AAAI, 1988, pp:100-104 [Conf]
  2. Zheng-Yang Liu, Arthur M. Farley
    Shifting Ontological Perspectives in Reasoning About Physical Systems. [Citation Graph (1, 0)][DBLP]
    AAAI, 1990, pp:395-400 [Conf]
  3. Arthur M. Farley
    On Waiting. [Citation Graph (0, 0)][DBLP]
    AAAI, 1980, pp:128-130 [Conf]
  4. Zheng-Yang Liu, Arthur M. Farley
    Structural Aggregation in Common-Sense Reasoning. [Citation Graph (0, 0)][DBLP]
    AAAI, 1991, pp:868-873 [Conf]
  5. Arthur M. Farley
    Population Structure and Artificial Evolution. [Citation Graph (0, 0)][DBLP]
    Artificial Evolution, 2005, pp:213-225 [Conf]
  6. Arthur M. Farley, Kathleen Freeman
    Burden of Proof in Legal Argumentation. [Citation Graph (0, 0)][DBLP]
    ICAIL, 1995, pp:156-164 [Conf]
  7. Arthur M. Farley
    Constructive Visual Imagery And Perception. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1975, pp:885-892 [Conf]
  8. Arthur M. Farley
    The Coordination of Multiple Goal Satisfaction. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1977, pp:495- [Conf]
  9. Satoshi Fujita, Arthur M. Farley
    Sparse Hypercube: A Minimal k-Line Broadcast Graph. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:320-324 [Conf]
  10. Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards
    Multi-Source Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:126-136 [Conf]
  11. Juan J. Flores, Arthur M. Farley
    Reasoning about Linear Circuits: A Model-Based Approach. [Citation Graph (0, 0)][DBLP]
    AI Commun., 1999, v:12, n:1-2, pp:61-77 [Journal]
  12. Kathleen Freeman, Arthur M. Farley
    A Model of Argumentation and Its Application to Legal Reasoning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell. Law, 1996, v:4, n:3-4, pp:163-197 [Journal]
  13. William S. Bergar, Arthur M. Farley, Garland Bayley
    Knowledge sources for an intelligent algebra tutor. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1986, v:2, n:, pp:117-129 [Journal]
  14. Arthur M. Farley, Andrzej Proskurowski
    Bounded-call broadcasting. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:37-53 [Journal]
  15. Arthur M. Farley, Andrzej Pelc, Andrzej Proskurowski
    Minimum-time multidrop broadcast. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:61-77 [Journal]
  16. Arthur M. Farley, Andrzej Proskurowski, Daniel Zappala, Kurt J. Windisch
    Spanners and message distribution in networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:2, pp:159-171 [Journal]
  17. Satoshi Fujita, Arthur M. Farley
    Sparse Hypercube - Minimal k-line Broadcast Graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:3, pp:431-446 [Journal]
  18. Satoshi Fujita, Arthur M. Farley
    Minimum-cost Line Broadcast in Paths. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:75, n:3, pp:255-268 [Journal]
  19. Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski
    Centering a Spanning Tree of a Biconnected Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:5, pp:247-250 [Journal]
  20. Arthur M. Farley
    Levelling Terrain Trees: A Transshipment Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:4/5, pp:189-192 [Journal]
  21. Arthur M. Farley, Andrzej Proskurowski
    Directed Maximal-Cut Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:5, pp:238-241 [Journal]
  22. Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards
    Multi-Source Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2000, v:1, n:1, pp:61-71 [Journal]
  23. Arthur M. Farley
    Minimal path broadcast networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:43, n:2, pp:61-70 [Journal]
  24. Arthur M. Farley
    Optimally Routable Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:4, pp:567-575 [Journal]
  25. Arthur M. Farley, Andrzej Proskurowski
    Self-Repairing Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:381-391 [Journal]
  26. Arthur M. Farley
    Choice and development. [Citation Graph (0, 0)][DBLP]
    GECCO (Companion), 2007, pp:2468-2474 [Conf]

  27. Internationalization of computer science education. [Citation Graph (, )][DBLP]


Search in 0.036secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002