Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Andrea Pohoreckyj Danyluk
2010 – today
- 2012
[c11]- 2010
- [j4]D. Baldwin, A. Brady, Andrea Pohoreckyj Danyluk, J. Adams, A. Lawrence: Case Studies of Liberal Arts Computer Science Programs. TOCE 10(1) (2010)
- [c10]David Andrew Moore, Andrea Pohoreckyj Danyluk: Deep Transfer as Structure Learning in Markov Logic Networks. Statistical Relational Artificial Intelligence 2010
- [c9]Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh: Introducing concurrency in CS 1. SIGCSE 2010: 224-228
2000 – 2009
- 2009
- [e2]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. ACM International Conference Proceeding Series 382, ACM 2009, ISBN 978-1-60558-516-1
- 2008
- [c8]Andrea Pohoreckyj Danyluk: Artificial Intelligence for Non-Majors at Multiple Levels. AAAI Spring Symposium: Using AI to Motivate Greater Participation in Computer Science 2008: 20-25
- 2005
- [c7]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
- [c6]Kim B. Bruce, Andrea Pohoreckyj Danyluk: Event-driven programming facilitates learning standard programming concepts. OOPSLA Companion 2004: 96-100
- 2001
- [c5]Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh: Event-driven programming is simple enough for CS1. ITiCSE 2001: 1-4
- [c4]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
- [e1]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. Morgan Kaufmann 2001, ISBN 1-55860-778-1
- 2000
- [j3]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)
1990 – 1999
- 1999
- [j2]Foster J. Provost, Andrea Pohoreckyj Danyluk: Problem Definition, Data Cleaning, and Evaluation: A Classifier Learning Case Study. Informatica (Slovenia) 23(1) (1999)
- 1996
- [j1]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
- [c3]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
1980 – 1989
- 1989
- [c2]Andrea Pohoreckyj Danyluk: Finding New Rules for Incomplete Theories: Explicit Biases for Induction with Contextual Information. ML 1989: 34-36
- 1987
- [c1]Andrea Pohoreckyj Danyluk: The Use of Explanations for Similarity-based Learning. IJCAI 1987: 274-276
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:09 CEST by the dblp team