An interactive system for hiring and managing graduate teaching assistants

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 730-734

  Lim, Ryan ^a   Guddeti, Venkata Praveen ^a   Choueiry, Berthe Y ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

% REDUCTIONS; ACTUAL USE; CONSTRAINT PROCESSING; GRADUATE TEACHING ASSISTANTS; INTERACTIVE SYSTEM; PROCESSING TECHNIQUE; PROTOTYPE SYSTEM; TASK-BASED; TEACHING AND RESEARCHES; WEB-BASED INTERFACE;

MULTIMEDIA SYSTEMS;

EID: 85017388822     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. R. Bartak. On-Line Guide to Constraint Programming, 1998.
2. C. Bessìere, Arc-Consistency in Dynamic Constraint Satisfaction Problems, in Proc. of AAAI 91, pp. 221-226, (1991).
3. R. Dechter. Home web page, 2001.
4. E.C. Freuder and R.J. Wallace, Partial Constraint Satisfaction, Artificial Intelligence, 58, 21-70, (1992).
5. R. Glaubius. A Constraint Processing Approach to Assigning Graduate Teaching Assistants to Courses. Undergraduate Honors Thesis. CSEUNL, 2001.
6. R. Glaubius and B.Y. Choueiry, Constraint Modeling and Reformulation in the Context of Academic Task Assignment, in Workshop on Modelling and Solving Problems with Constraints (ECAI 02), (2002).
7. R. Glaubius and B.Y. Choueiry. Constraint Modeling and Reformulation in the Context of Academic Task Assignment. Poster presentation at SARA 02, 2002.
8. R. Glaubius and B.Y. Choueiry, Constraint Modeling in the Context of Academic Task Assignment, in Proc. of CP02, LNCS 2470, p. 789, (2002).
9. C.P. Gomes, B. Selman, and H. Kautz, Boosting Combinatorial Search Through Randomization, in Proc. of AAAI 98, pp. 431-437, (1998).
10. V. Guddeti, Empirical Evaluation of Heuristic and Randomized Backtrack Search, Masters thesis, CSE-UNL, 2004. Forthcoming.
11. V. Guddeti, H. Zou, and B.Y. Choueiry. An Empirical Study of Heuristic and Randomized Search Techniques in a Real-World Setting, 2004. Under review.
12. J. Liu, H. Jing, and Y.Y. Tang, Multi-Agent oriented constraint satisfaction, Artificial Intelligence, 136, 101-144, (2002).
13. S. Minton, M. D. Johnston, A. B. Philips, and P. Laird, Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems, Artificial Intelligence, 58, 161-205, (1992).
14. V.R. Thota. Using Constraint Propagation to Support Interactive Resource Allocation. Masters Project, CSE-UNL, 2004. Forthcoming.
15. T. Walsh, Search in a Small World, in Proc. of IJCAI 99, pp. 1172- 1177, (1999).
16. H. Zou, Iterative Improvement Techniques for Solving Tight Constraint Satisfaction Problems, Masters thesis, CSE-UNL, 2003.
17. H. Zou and B.Y. Choueiry, Characterizing the Behavior of a Multi-Agent Search by Using it to Solve a Tight, Real-World Resource Allocation Problem, in Workshop on Applications of Constraint Programming (CP 02), pp. 81-101, (2003).