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.
Berthe Y. Choueiry
2010 – today
- 2012
[c36]Robert J. Woodward, Shant Karakashian, Berthe Y. Choueiry, Christian Bessiere: Revisiting Neighborhood Inverse Consistency on Binary CSPs. CP 2012: 688-703- 2011
[c35]Robert J. Woodward, Shant Karakashian, Berthe Y. Choueiry, Christian Bessiere: Solving Difficult CSPs with Relational Neighborhood Inverse Consistency. AAAI 2011
[c34]Robert J. Woodward, Shant Karakashian, Berthe Y. Choueiry, Christian Bessiere: Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs. AAAI 2011
[c33]Shant Karakashian, Robert J. Woodward, Berthe Y. Choueiry: Reformulating R(*, m)C with Tree Decomposition. SARA 2011
[c32]Amanda Swearngin, Berthe Y. Choueiry, Eugene C. Freuder: A Reformulation Strategy for Multi-Dimensional CSPs: The Case Study of the SET Game. SARA 2011
[c31]Robert J. Woodward, Shant Karakashian, Berthe Y. Choueiry, Christian Bessiere: Reformulating the Dual Graphs of CSPs to Improve the Performance of Relational Neighborhood Inverse Consistency. SARA 2011- 2010
[j4]
[c30]Shant Karakashian, Robert J. Woodward, Christopher G. Reeson, Berthe Y. Choueiry, Christian Bessiere: A First Practical Algorithm for High Levels of Relational Consistency. AAAI 2010
[c29]Shant Karakashian, Robert J. Woodward, Berthe Y. Choueiry, Christian Bessiere: Relational consistency by constraint filtering. SAC 2010: 2073-2074
[i1]Shant Karakashian, Robert J. Woodward, Berthe Y. Choueiry, Steven Prestwhich, Eugene C. Freuder: A Partial Taxonomy of Substitutability and Interchangeability. CoRR abs/1010.4609 (2010)
2000 – 2009
- 2007
[c28]Christopher G. Reeson, Kai-Chen Huang, Kenneth M. Bayer, Berthe Y. Choueiry: An Interactive Constraint-Based Approach to Sudoku. AAAI 2007: 1976-1977
[c27]Kenneth M. Bayer, Martin Michalowski, Berthe Y. Choueiry, Craig A. Knoblock: Reformulating CSPs for Scalability with Application to Geospatial Reasoning. CP 2007: 164-179
[c26]Martin Michalowski, Craig A. Knoblock, Kenneth M. Bayer, Berthe Y. Choueiry: Exploiting automatically inferred constraint-models for building identification in satellite imagery. GIS 2007: 6
[c25]Kenneth M. Bayer, Martin Michalowski, Berthe Y. Choueiry, Craig A. Knoblock: Reformulating Constraint Satisfaction Problems to Improve Scalability. SARA 2007: 64-79
[c24]Martin Michalowski, Craig A. Knoblock, Berthe Y. Choueiry: Reformulating Constraint Models Using Input Data. SARA 2007: 402-404- 2006
[c23]Kenneth M. Bayer, Josh Snyder, Berthe Y. Choueiry: An Interactive Constraint-Based Approach to Minesweeper. AAAI 2006: 1933-1934- 2005
[j3]Berthe Y. Choueiry, Yumi Iwasaki, Sheila A. McIlraith: Towards a practical theory of reformulation for reasoning about physical systems. Artif. Intell. 162(1-2): 145-204 (2005)
[c22]Anagh Lal, Berthe Y. Choueiry, Eugene C. Freuder: Neighborhood Interchangeability and Dynamic Bundling for Non-Binary Finite CSPs. AAAI 2005: 397-404
[c21]Yaling Zheng, Berthe Y. Choueiry: Applying Decomposition Methods to Crossword Puzzle Problems. CP 2005: 874
[c20]Joel M. Gompert, Berthe Y. Choueiry: A Decomposition Technique for CSPs Using Maximal Independent Sets and Its Integration with Local Search. FLAIRS Conference 2005: 167-174- 2004
[j2]Berthe Y. Choueiry, Lin Xu: An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem. AI Commun. 17(4): 213-221 (2004)
[c19]
[c18]
[c17]Ryan Lim, Venkata Praveen Guddeti, Berthe Y. Choueiry: A Constraint-Based System for Hiring and Managing Graduate Teaching Assistants. CP 2004: 817
[c16]Venkata Praveen Guddeti, Berthe Y. Choueiry: Characterization of a New Restart Strategy for Randomized Backtrack Search. CSCLP 2004: 56-70
[c15]Yaling Zheng, Berthe Y. Choueiry: New Structural Decomposition Techniques for Constraint Satisfaction Problems. CSCLP 2004: 113-127
[c14]Ryan Lim, Venkata Praveen Guddeti, Berthe Y. Choueiry: An Interactive System for Hiring and Managing Graduate Teaching Assistants. ECAI 2004: 730-734- 2003
[c13]
[c12]- 2002
[c11]Robert Glaubius, Berthe Y. Choueiry: Constraint Modeling in the Context of Academic Task Assignment. CP 2002: 789
[c10]Berthe Y. Choueiry, Amy M. Davis: Dynamic Bundling: Less Effort for More Solutions. SARA 2002: 64-82- 2001
[j1]Berthe Y. Choueiry, Toby Walsh: Symposium on Abstraction, Reformulation, and Approximation (SARA-2000). AI Magazine 22(1): 137-138 (2001)
[c9]Amy M. Beckwith, Berthe Y. Choueiry, Hui Zou: How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search. Australian Joint Conference on Artificial Intelligence 2001: 50-61
[c8]Amy M. Beckwith, Berthe Y. Choueiry: On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems. CP 2001: 760- 2000
[e1]Berthe Y. Choueiry, Toby Walsh (Eds.): Abstraction, Reformulation, and Approximation, 4th International Symposium, SARA 2000, Horseshoe Bay, Texas, USA, July 26-29, 2000, Proceedings. Lecture Notes in Computer Science 1864, Springer 2000, ISBN 3-540-67839-5
1990 – 1999
- 1998
[c7]Berthe Y. Choueiry, Guevara Noubir: On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems. AAAI/IAAI 1998: 326-333- 1996
[c6]Rainer Weigel, Boi Faltings, Berthe Y. Choueiry: Context in Discrete Constraint Satisfaction Problems. ECAI 1996: 205-212
[c5]Guevara Noubir, Berthe Y. Choueiry: Algebraic Techniques for the Optimization of Control Flow Checking. FTCS 1996: 128-137
[c4]Guevara Noubir, Berthe Y. Choueiry, Henri J. Nussbaumer: Fault tolerant multiple observers using error control codes. ICNP 1996: 84-91- 1995
[c3]
[c2]Berthe Y. Choueiry, Boi Faltings, Rainer Weigel: Abstraction by Interchangeability in Resource Allocation. IJCAI 1995: 1694-1703- 1994
[c1]Berthe Y. Choueiry, Boi Faltings: A Decomposition Heuristic for Resource Allocation. ECAI 1994: 585-589
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-22 19:20 CET by the dblp team



