Berthe Y. Choueiry

According to our database1, Berthe Y. Choueiry authored at least 52 papers between 1994 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Visualizations to Summarize Search Behavior.
Proceedings of the Principles and Practice of Constraint Programming, 2020

2018
A Reactive Strategy for High-Level Consistency During Search.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Solving Sudoku with Consistency: A Visual and Interactive Approach.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

PW-AC: Extending Compact-Table to Enforce Pairwise Consistency on Table Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2018

2017
Weight-Based Variable Ordering in the Context of High-Level Consistencies.
CoRR, 2017

Cycle-Based Singleton Local Consistencies.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2015
Characterizing Performance of Consistency Algorithms by Algorithm Configuration of Random CSP Generators.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Adaptive Parameterized Consistency for Non-binary CSPs by Counting Supports.
Proceedings of the Principles and Practice of Constraint Programming, 2014

Improving Relational Consistency Algorithms Using Dynamic Relation Partitioning.
Proceedings of the Principles and Practice of Constraint Programming, 2014

2013
Improving the Performance of Consistency Algorithms by Localizing and Bolstering Propagation in a Tree Decomposition.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Selecting the Appropriate Consistency Algorithm for CSPs Using Machine Learning Classifiers.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Revisiting Neighborhood Inverse Consistency on Binary CSPs.
Proceedings of the Principles and Practice of Constraint Programming, 2012

2011
Reformulating the Dual Graphs of CSPs to Improve the Performance of Relational Neighborhood Inverse Consistency.
Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation, 2011

A Reformulation Strategy for Multi-Dimensional CSPs: The Case Study of the SET Game.
Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation, 2011

Reformulating R(*, m)C with Tree Decomposition.
Proceedings of the Ninth Symposium on Abstraction, Reformulation, and Approximation, 2011

Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

Solving Difficult CSPs with Relational Neighborhood Inverse Consistency.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
A Partial Taxonomy of Substitutability and Interchangeability
CoRR, 2010

Preface.
Ann. Math. Artif. Intell., 2010

Relational consistency by constraint filtering.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

A First Practical Algorithm for High Levels of Relational Consistency.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2007
Reformulating Constraint Models Using Input Data.
Proceedings of the Abstraction, 2007

Reformulating Constraint Satisfaction Problems to Improve Scalability.
Proceedings of the Abstraction, 2007

Exploiting automatically inferred constraint-models for building identification in satellite imagery.
Proceedings of the 15th ACM International Symposium on Geographic Information Systems, 2007

Reformulating CSPs for Scalability with Application to Geospatial Reasoning.
Proceedings of the Principles and Practice of Constraint Programming, 2007

An Interactive Constraint-Based Approach to Sudoku.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
An Interactive Constraint-Based Approach to Minesweeper.
Proceedings of the Proceedings, 2006

2005
Towards a practical theory of reformulation for reasoning about physical systems.
Artif. Intell., 2005

A Decomposition Technique for CSPs Using Maximal Independent Sets and Its Integration with Local Search.
Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, 2005

Applying Decomposition Methods to Crossword Puzzle Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2005

Neighborhood Interchangeability and Dynamic Bundling for Non-Binary Finite CSPs.
Proceedings of the Proceedings, 2005

2004
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem.
AI Commun., 2004

An Interactive System for Hiring and Managing Graduate Teaching Assistants.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

New Structural Decomposition Techniques for Constraint Satisfaction Problems.
Proceedings of the Recent Advances in Constraints, 2004

Characterization of a New Restart Strategy for Randomized Backtrack Search.
Proceedings of the Recent Advances in Constraints, 2004

A Constraint-Based System for Hiring and Managing Graduate Teaching Assistants.
Proceedings of the Principles and Practice of Constraint Programming, 2004

Constraint Processing Techniques for Improving Join Computation: A Proof of Concept.
Proceedings of the Constraint Databases, 2004

Evaluating Consistency Algorithms for Temporal Metric Constraints.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
A New Efficient Algorithm for Solving the Simple Temporal Problem.
Proceedings of the 10th International Symposium on Temporal Representation and Reasoning / 4th International Conference on Temporal Logic (TIME-ICTL 2003), 2003

Improving Backtrack Search for Solving the TCSP.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
Dynamic Bundling: Less Effort for More Solutions.
Proceedings of the Abstraction, 2002

Constraint Modeling in the Context of Academic Task Assignment.
Proceedings of the Principles and Practice of Constraint Programming, 2002

2001
Symposium on Abstraction, Reformulation, and Approximation (SARA-2000).
AI Mag., 2001

On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems.
Proceedings of the Principles and Practice of Constraint Programming, 2001

How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search.
Proceedings of the AI 2001: Advances in Artificial Intelligence, 2001

1998
On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1996
Fault tolerant multiple observers using error control codes.
Proceedings of the 1996 International Conference on Network Protocols, 1996

Algebraic Techniques for the Optimization of Control Flow Checking.
Proceedings of the Digest of Papers: FTCS-26, 1996

Context in Discrete Constraint Satisfaction Problems.
Proceedings of the 12th European Conference on Artificial Intelligence, 1996

1995
Abstraction by Interchangeability in Resource Allocation.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Using Abstractions for Resource Allocation.
Proceedings of the 1995 International Conference on Robotics and Automation, 1995

1994
A Decomposition Heuristic for Resource Allocation.
Proceedings of the Eleventh European Conference on Artificial Intelligence, 1994


  Loading...