| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | D. Baldwin, A. Brady, Andrea Pohoreckyj Danyluk, J. Adams, A. Lawrence |
Case Studies of Liberal Arts Computer Science Programs.  |
TOCE  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh |
Introducing concurrency in CS 1. |
SIGCSE |
2010 |
DBLP DOI BibTeX RDF |
objectdraw, java, concurrency, cs 1 |
| 1 | David Andrew Moore, Andrea Pohoreckyj Danyluk |
Deep Transfer as Structure Learning in Markov Logic Networks. |
Statistical Relational Artificial Intelligence |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrea Pohoreckyj Danyluk, Léon Bottou, Michael L. Littman (eds.) |
Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009 |
ICML |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrea Pohoreckyj Danyluk |
Artificial Intelligence for Non-Majors at Multiple Levels. |
AAAI Spring Symposium: Using AI to Motivate Greater Participation in Computer Science |
2008 |
DBLP BibTeX RDF |
|
| 1 | Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh |
Why structural recursion should be taught before arrays in CS 1. |
SIGCSE |
2005 |
DBLP DOI BibTeX RDF |
CS1, recursion |
| 1 | Kim B. Bruce, Andrea Pohoreckyj Danyluk |
Event-driven programming facilitates learning standard programming concepts. |
OOPSLA Companion |
2004 |
DBLP DOI BibTeX RDF |
java, CS 1, event-driven programming |
| 1 | Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh |
Event-driven programming is simple enough for CS1. |
ITiCSE |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Carla E. Brodley, Andrea Pohoreckyj Danyluk (eds.) |
Proceedings of the Eighteenth International Conference on Machine Learning (ICML 2001), Williams College, Williamstown, MA, USA, June 28 - July 1, 2001 |
|
2001 |
DBLP BibTeX RDF |
|
| 1 | Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh |
A library to support a graphics-based object-first approach to CS 1. |
SIGCSE |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan Davis Burns, Andrea Pohoreckyj Danyluk |
Feature Selection vs Theory Reformulation: A Study of Genetic Refinement of Knowledge-based Neural Networks. |
Machine Learning |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Foster J. Provost, Andrea Pohoreckyj Danyluk |
Problem Definition, Data Cleaning, and Evaluation: A Classifier Learning Case Study. |
Informatica (Slovenia) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Christopher J. Merz, Michael J. Pazzani, Andrea Pohoreckyj Danyluk |
Tuning Numeric Parameters to Troubleshoot a Telephone-Network Loop. (PDF / PS) |
IEEE Expert |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrea Pohoreckyj Danyluk, Foster J. Provost |
Small Disjuncts in Action: Learning to Diagnose Errors in the Local Loop of the Telephone Network. |
ICML |
1993 |
DBLP BibTeX RDF |
|
| 1 | Andrea Pohoreckyj Danyluk |
Finding New Rules for Incomplete Theories: Explicit Biases for Induction with Contextual Information. |
ML |
1989 |
DBLP BibTeX RDF |
|
| 1 | Andrea Pohoreckyj Danyluk |
The Use of Explanations for Similarity-based Learning. |
IJCAI |
1987 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")