dblp.uni-trier.dewww.uni-trier.de

Arthur M. Farley Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1John S. Anderson [7]
2Garland Bayley [6]
3William S. Bergar [6]
4Grant A. Cheston [8]
5Juan J. Flores [18]
6Paraskevi Fragopoulou [19] [21]
7Kathleen Freeman [13] [14]
8Satoshi Fujita [15] [20] [22]
9Stephen T. Hedetniemi [8]
10David W. Krumme [19] [21]
11Zheng-Yang Liu [9] [10]
12Andrzej Pelc [17]
13Andrzej Proskurowski [5] [8] [11] [12] [17] [19] [21] [24] [25]
14Dana Richards [19] [21]
15Kurt J. Windisch [24]
16Daniel Zappala [24]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)