David Furcy's home page

David A. Furcy, Ph.D., Assistant Professor

Address:	Computer Science Department University of Wisconsin Oshkosh 800 Algoma Boulevard Oshkosh, WI 54901-8643
Email:	furcyd AT uwosh DOT edu

Sven Koenig, Wheeler Ruml, Rong Zhou, and I are organizing the

First International Symposium on Search Techniques in Artificial Intelligence and Robotics.

Teaching

Fall 2008

Past Semesters

CS142 Elementary Programming in Visual Basic: Fall 2005 (x2)
CS221 Object-Oriented Design and Programming I: Spring 2006 (x2), Fall 2006, Spring 2007 (x2), Fall 2007
CS271 Data Structures: Fall 2007
CS321 File Structures: Fall 2005, Fall 2006, Fall 2007
CS331 Programming Languages: Spring 2007, Spring 2008
CS381 Introduction to the Theory of Computing: Fall 2006, Spring 2008
CS399/490 Internship/Practicum: Spring 2008
CS480 Topics in Computer Science: Heuristic Search: Spring 2006

Professional Experience

Fall 2005 - Present	Assistant Professor University of Wisconsin Oshkosh , Department of Computer Science , Oshkosh, WI
Spring 2005	Interim Professor (one-semester sabbatical replacement) Blackburn College , Department of Mathematics and Computer Science , Carlinville, IL

Curriculum Vitae

(revised 10/15/06)

[pdf]

Main Research Interests

Artificial Intelligence (AI)
- Heuristic search, including real-time, offline, incremental, and anytime search
- Planning and replanning
- Reinforcement learning
Algorithm visualization for CS education
- JHAVEPOP: Automated visualization of linked lists in C++ or Java (similar to Jeffrey Popyack's Pascal Pointers)

Affiliations

AAAI
ACM
SIGCSE
Past affiliations: Intelligent Systems Group , College of Computing , Georgia Institute of Technology

Journal Articles, Magazine Articles, and Book Chapters

(with A. Felner , R. Holte , R. Meshulam, and J. Newton ) Maximizing over Multiple Pattern Databases Speeds up Heuristic Search ; Artificial Intelligence; Vol. 170 (16-17); p. 1123-1136; November 2006
(with S. Koenig , M. Likhachev , and Y. Liu ) Incremental Heuristic Search in AI; Artificial Intelligence Magazine ; Vol. 25 (2); p. 99-112; Summer 2004
[bibtex ]
(with S. Koenig and M. Likhachev ) Lifelong Planning A*; Artificial Intelligence; Vol. 155 (1-2); p. 93-146; May 2004
[bibtex ]
(with S. Koenig ) STRIPS, In L. Nadel (Ed.), Encyclopedia of Cognitive Science; London: Macmillan; December 2002

Conference and Workshop Articles

(with T. Naps, and Jason Wentworth) Sorting Out Sorting - The Sequel; Accepted at ITiCSE-08
(with S. Grissom, M. McNally, T. Naps, and C. Trefftz) Supporting the Rapid Development of Pedagogically Effective Algorithm Visualizations; Accepted at CCSC:MW-2007
(with A. Jungwirth and T. Naps) BlockTree: Pedagogical Information Visualization for Heuristic Search; Accepted at FLAIRS-2007
ITSA*: Iterative Tunneling Search with A*; AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications; p. 21-26; 2006
[pdf]
(with S. Koenig) Limited discrepancy Beam Search; Nineteenth International Joint Conference on Artificial Intelligence (IJCAI); p. 125-131; 2005
(with S. Koenig) Scaling up WA* with Commitment and Diversity; Nineteenth International Joint Conference on Artificial Intelligence (IJCAI); p. 1521-1522; 2005
(with A. Felner , R. Holte , R. Meshulam, and J. Newton ) Multiple Pattern Databases ; 14th International Conference on Automated Planning & Scheduling (ICAPS); p. 122-131; 2004 (runner-up for Best Paper Award)
[ps ][pdf ][bibtex]
(with S. Koenig and Y. Liu ) Speeding up the Calculation of Heuristics for Heuristic Search-Based Planning ; National Conference on Artificial Intelligence (AAAI); p. 484-491; 2002
[ps ] [pdf ] [bibtex ]
(with C. Bauer and S. Koenig ) Heuristic Search-Based Replanning ; International Conference on Artificial Intelligence Planning & Scheduling (AIPS); p. 310-317; 2002
[ps ] [pdf ] [bibtex ]
(with S. Koenig ) Combining Two Fast-Learning Real-Time Search Algorithms Yields Even Faster Learning ; European Conference on Planning (ECP); 2001
[ps ] [pdf ] [bibtex ]
(with S. Koenig ) Speeding up the Convergence of Real-Time Search ; National Conference on Artificial Intelligence (AAAI); p. 891-897; 2000
[ps ] [pdf ] [bibtex ]

Technical Reports and Theses

Limited Discrepancy Beam Search; Technical Report GIT-COGSCI-2004/02; College of Computing, Georgia Institute of Technology, Atlanta; May 2004
Scaling up Weighted A* with Commitment and Diversity; Technical Report GIT-COGSCI-2004/01; College of Computing, Georgia Institute of Technology, Atlanta; May 2004
eFALCONS: Speeding up the Convergence of Real-Time Search Even More; Technical Report GIT-COGSCI-2001/04; College of Computing, Georgia Institute of Technology, Atlanta; July 2001
(with S. Koenig ) Speeding up the Convergence of Real-Time Search: Empirical Setup and Proofs ; Technical Report GIT-COGSCI-2000/01; College of Computing, Georgia Institute of Technology, Atlanta; March 2000

pdf

Formal description of and experiments with Knuth-Bendix-based theorem proving in Otter; M.S. thesis; Computer Science Department , University of Iowa ; July 1997
Suivi de systêmes dynamiques à partir de scénarios temporels. Application au suivi d'une flotte de taxis-robots (in French); Mémoire de DEA (M.S. thesis); Heudiasyc , Université de Technologie de Compiègne ; September 1994

Free counter