The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Robert P. Daley: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.018secs, Finished in 0.020secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002