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