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

Robert P. Daley

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

1997
33EERobert P. Daley, Bala Kalyanasundaram: FINite Learning Capabilities and Their Limits. COLT 1997: 81-89
1995
32 Robert P. Daley, Bala Kalyanasundaram: Towards Reduction Argumentf for FINite Learning. GOSLER Final Report 1995: 63-75
31 Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai: Breaking the Probability 1/2 Barrier in FIN-Type Learning. J. Comput. Syst. Sci. 50(3): 574-599 (1995)
1993
30 Robert P. Daley, Bala Kalyanasundaram: Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities. ALT 1993: 173-186
29EERobert P. Daley, Bala Kalyanasundaram: Capabilities of Probabilistic Learners with Bounded Mind Changes. COLT 1993: 182-191
28EERobert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai: Capabilities of fallible FINite Learning. COLT 1993: 199-208
1992
27 Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai: The Power of Probabilism in Popperian FINite Learning (extended abstract). AII 1992: 151-169
26EERobert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai: Breaking the Probability 1/2 Barrier in FIN-Type Learning. COLT 1992: 203-217
25 Robert P. Daley, Bala Kalyanasundaram: Probabilistic and Pluralistic Learners with Mind Changes. MFCS 1992: 218-226
1991
24EERobert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will: Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). COLT 1991: 228-239
23 Robert P. Daley: Multi-Agent Learning: Theoretical and Empirical Studies. Nonmonotonic and Inductive Logic 1991: 175-183
1988
22EERobert P. Daley: Transformation of Probabilistic Learning Strategies into Deterministic Learning Strategies. COLT 1988: 220-226
1986
21 Robert P. Daley: Towards the Development of an Analysis of Learning Algorithms (Invited Key Note). AII 1986: 1-18
20 Robert P. Daley: Using the Algorithm of Analogy for Generation of Robot Programs. AII 1986: 19-22
19 Robert P. Daley, Carl H. Smith: On the Complexity of Inductive Inference Information and Control 69(1-3): 12-40 (1986)
1985
18 Robert P. Daley: Inductive inference hierarchies: probabilistic vs pluralistic strategies. Mathematical Methods of Specification and Synthesis of Software Systems 1985: 73-82
1984
17 Robert P. Daley, Carl H. Smith: On the Complexity of Inductive Inference (Preliminary Report). MFCS 1984: 255-264
16 Robert P. Daley, Carl H. Smith: On the complextiy of inductive inference. Bulletin of the EATCS 23: 22-27 (1984)
1983
15 Robert P. Daley: On the Error Correcting Power of Pluralism in BC-Type Inductive Inference. Theor. Comput. Sci. 24: 95-104 (1983)
1982
14 Robert P. Daley: Busy Beaver Sets: Characterizations and Applications Information and Control 52(1): 52-67 (1982)
1981
13 Robert P. Daley: On the Error Correcting Power of Pluralism in Inductive Inference. FCT 1981: 90-99
12 Robert P. Daley: Retraceability, Repleteness and Busy Beaver Sets. MFCS 1981: 252-261
11 Robert P. Daley: Busy Beaver Sets and the Degrees of Unsolvability. J. Symb. Log. 46(3): 460-474 (1981)
1980
10 Robert P. Daley: Quantitative and Qualitative Information in Computations Information and Control 45(3): 236-244 (1980)
1979
9 Robert P. Daley: On the Simplification of Constructions in Degrees of Unsolvability via Computational Complexity. MFCS 1979: 258-265
1977
8 Robert P. Daley: On the Inference of Optimal Descriptions. Theor. Comput. Sci. 4(3): 301-319 (1977)
1976
7 Robert P. Daley: Noncomplex Sequences: Characterizations and Examples. J. Symb. Log. 41(3): 626-638 (1976)
1975
6 Robert P. Daley: Minimal-Program Complexity of Pseudo-Recursive and Pseudo-Random Sequences. Mathematical Systems Theory 9(1): 83-94 (1975)
1974
5 Robert P. Daley: Non-Complex Sequences: Characterizations and Examples FOCS 1974: 165-169
4 Robert P. Daley: The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies. J. Comput. Syst. Sci. 9(2): 151-163 (1974)
1973
3 Robert P. Daley: The Process Complexity and the Understanding of Sequences. MFCS 1973: 215-218
2 Robert P. Daley: Minimal-Program Complexity of Sequences with Restricted Resources Information and Control 23(4): 301-312 (1973)
1EERobert P. Daley: An Example of Information and Computation Resource Trade-Off. J. ACM 20(4): 687-695 (1973)

Coauthor Index

1Bala Kalyanasundaram [25] [26] [27] [28] [29] [30] [31] [32] [33]
2Leonard Pitt [24]
3Carl H. Smith [16] [17] [19]
4Mahendran Velauthapillai [24] [26] [27] [28] [31]
5Todd Will [24]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)