ConSystLab About News Our Work Resources Courses
 
Our work: Publications

Peer-reviewed publications: (in reverse chronological order)

    2010
  1. Relational Consistency by Constraint Filtering
    Shant Karakashian, Robert J. Woodward, Berthe Y. Choueiry, and Christian Bessiere
    2. 2007
  2. Exploiting Automatically Inferred Constraint Models for Building Identification in Satellite Imagery
    Martin Michalowski, Craig A. Knoblock, Ken M. Bayer, and Berthe Y. Choueiry
  3. Exploiting Problem Data to Enrich Models of Constraint Problems
    Martin Michalowski, Craig A. Knoblock, and Berthe Y. Choueiry
    • Sixth International Workshop On Constraint Modeling and Reformulation (ModRef'07) (PS, PDF).
    • Poster: PNG
    • Bibtex entry

  4. Reformulating CSPs for Scalability with Application to Geospatial Reasoning
    Ken M. Bayer, Martin Michalowski, Berthe Y. Choueiry, and Craig A. Knoblock
  5. An Interactive Constraint-Based Approach to Sudoku
    Christopher G. Reeson, Kai-Chen Huang, Kenneth M. Bayer, and Berthe Y. Choueiry

  6. Reformulating Constraint Models Using Input Data
    Martin Michalowski, Craig A. Knoblock, and Berthe Y. Choueiry

  7. Reformulating Constraint Satisfaction Problems to Improve Scalability
    Ken M. Bayer, Martin Michalowski, Berthe Y. Choueiry, and Craig A. Knoblock
    8. 2006
  8. An Interactive Constraint-Based Approach to Minesweeper
    Ken Bayer, Joshua Snyder, and Berthe Y. Choueiry
    9. 2005
  9. Neighborhood Interchangeability and Dynamic Bundling for Non-Binary Finite CSPs
    Anagh Lal, Berthe Y. Choueiry, and Eugene C. Freuder

  10. Applying Decomposition Methods to Crossword Puzzle Problems
    Yaling Zheng

  11. Real-time Simulation of Herds Moving Over Terrain
    Joel Gompert
    • First Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE 2005) (PS, PDF)
    • PosterPPT
    • Bibtex entry

  12. A Decomposition Technique for CSPs Using Maximal Independent Sets and Its Integration with Local Search
    Joel Gompert and Berthe Y. Choueiry

  13. New Structural Decomposition Techniques for Constraint Satisfaction Problems
    Yaling Zheng and Berthe Y. Choueiry

  14. Characterization of a New Restart Strategy for Randomized Backtrack Search
    Venkata Praveen Guddeti and Berthe Y. Choueiry

  15. Towards a Practical Theory of Reformulation for Reasoning About Physical Systems
    Berthe Y. Choueiry, Yumi Iwasaki, and Sheila McIlraith
    16. 2004
  16. An Empirical Study of a New Restart Strategy for Randomized Backtrack Search
    Venkata Praveen Guddeti and Berthe Y. Choueiry

  17. An Efficient Consistency Algorithm for the Temporal Constraint Satisfaction Problem
    Berthe Y. Choueiry and Lin Xu
  18. Local Search With Maximal Independent Sets
    19. Joel M. Gompert
  19. A Dynamic Restart Strategy for Randomized BT Search
    Venkata Praveen Guddeti

  20. A Constraint-Based System for Hiring and Managing Graduate Teaching Assistants
    Ryan Lim, Praveen Guddeti, and Berthe Y. Choueiry

  21. Cut-and-Traverse: A New Structural Decomposition Strategy for Finite Constraint Satisfaction Problems
    Yaling Zheng and Berthe Y. Choueiry

  22. Neighborhood Interchangeability and Dynamic Bundling for Non-Binary Finite CSPs
    Anagh Lal, Berthe Y. Choueiry, and Eugene C. Freuder

  23. An Interactive System for Hiring and Managing Graduate Teaching Assistants
    Ryan Lim, Venkata Praveen Guddeti, and Berthe Y. Choueiry

  24. Evaluating Consistency Algorithms for Temporal Metric Constraints
    Yang Shi, Anagh Lal, and Berthe Y. Choueiry

  25. Constraint Satisfaction
    Berthe Y. Choueiry

  26. Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
    Anagh Lal and Berthe Y. Choueiry
    27. 2003
  27. Characterizing the Behavior of a Multi-Agent Search by Using it to Solve a Tight, Real-World Resource Allocation Problem
    Hui Zou and B.Y. Choueiry

  28. Dynamic Detection and Exploitation of Value Symmetries for Non-Binary Finite CSPs
    29. Anagh Lal and Berthe Y. Choueiry

  29. Improving Backtrack Search for Solving the TCSP
    Lin Xu and Berthe Y. Choueiry

  30. A New Efficient Algorithm for Solving the Simple Temporal Problem
    Lin Xu and Berthe Y. Choueiry

  31. An Approximation of Generalized Arc-Consistency for TCSP
    Lin Xu and Berthe Y. Choueiry

  32. Efficient Techniques for Searching the TCSP
    Lin Xu and Berthe Y. Choueiry

  33. Multi-agent Based Search versus Local Search and Backtrack Search for Solving Tight CSPs: A Practical Case Study
    Hui Zou and Berthe Y. Choueiry

  34. Abstraction in Artificial Intelligence
    Robert C. Holte and Berthe Y. Choueiry
    • Philosophical Transactions of the Royal Society: Biological Sciences, June 2003. (PDF)
    • Bibtex entry
    35. 2002
  35. Dynamic Bundling: Less Effort for More Solutions
    Berthe Y. Choueiry and Amy M. Davis

  36. Constraint Modeling in the Context of Academic Task Assignment
    Robert Glaubius and Berthe Y. Choueiry

  37. Constraint Modeling and Reformulation in the Context of Academic Task Assignment
    Robert Glaubius and Berthe Y. Choueiry
    38. 2001
  38. On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems
    Amy M. Beckwith and Berthe Y. Choueiry

  39. How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search
    Amy M. Beckwith, Berthe Y. Choueiry, and Hui Zou
    40. 2000
  40. Proceedings of the Symposium on Abstraction, Reformulation and Approximation
    Berthe Y. Choueiry and Toby Walsh