The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrea Pohoreckyj Danyluk: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrea Pohoreckyj Danyluk
    Finding New Rules for Incomplete Theories: Explicit Biases for Induction with Contextual Information. [Citation Graph (0, 0)][DBLP]
    ML, 1989, pp:34-36 [Conf]
  2. Andrea Pohoreckyj Danyluk, Foster J. Provost
    Small Disjuncts in Action: Learning to Diagnose Errors in the Local Loop of the Telephone Network. [Citation Graph (0, 0)][DBLP]
    ICML, 1993, pp:81-88 [Conf]
  3. Andrea Pohoreckyj Danyluk
    The Use of Explanations for Similarity-based Learning. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1987, pp:274-276 [Conf]
  4. Kim B. Bruce, Andrea Pohoreckyj Danyluk
    Event-driven programming facilitates learning standard programming concepts. [Citation Graph (0, 0)][DBLP]
    OOPSLA Companion, 2004, pp:96-100 [Conf]
  5. Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh
    Why structural recursion should be taught before arrays in CS 1. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2005, pp:246-250 [Conf]
  6. Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh
    A library to support a graphics-based object-first approach to CS 1. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2001, pp:6-10 [Conf]
  7. Christopher J. Merz, Michael J. Pazzani, Andrea Pohoreckyj Danyluk
    Tuning Numeric Parameters to Troubleshoot a Telephone-Network Loop. [Citation Graph (0, 0)][DBLP]
    IEEE Expert, 1996, v:11, n:1, pp:44-49 [Journal]
  8. Foster J. Provost, Andrea Pohoreckyj Danyluk
    Problem Definition, Data Cleaning, and Evaluation: A Classifier Learning Case Study. [Citation Graph (0, 0)][DBLP]
    Informatica (Slovenia), 1999, v:23, n:1, pp:- [Journal]
  9. Brendan Davis Burns, Andrea Pohoreckyj Danyluk
    Feature Selection vs Theory Reformulation: A Study of Genetic Refinement of Knowledge-based Neural Networks. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2000, v:38, n:1-2, pp:89-107 [Journal]

  10. Introducing concurrency in CS 1. [Citation Graph (, )][DBLP]


  11. Event-driven programming is simple enough for CS1. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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