Výsledky vyhledávání - "Berthe Y. Choueiry"

Visualizations to Summarize Search Behavior

Autor: Ian S. Howell, Hongfeng Yu, Berthe Y. Choueiry

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030584740
CP

In this paper, we argue that metrics that assess the performance of backtrack search for solving a Constraint Satisfaction Problem should not be visualized and examined only at the end of search, but their evolution should be tracked throughout the s

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::59e26525e198efd7cfe2d623e84715b2
https://doi.org/10.1007/978-3-030-58475-7_23

Zobrazit plný text záznamu

A Reactive Strategy for High-Level Consistency During Search

Autor: Berthe Y. Choueiry, Christian Bessiere, Robert J. Woodward

Publikováno v: 27th International Joint Conference on Artificial Intelligence
IJCAI: International Joint Conference on Artificial Intelligence
IJCAI: International Joint Conference on Artificial Intelligence, Jul 2018, Stockholm, Sweden. pp.1390-1397, ⟨10.24963/ijcai.2018/193⟩
IJCAI

International audience; Constraint propagation during backtrack search significantly improves the performance of solving a Constraint Satisfaction Problem. While Generalized Arc Consistency (GAC) is the most popular level of propagation, higher-level

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61d545943720330422393e61ea2113bd
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01897930

Zobrazit plný text záznamu

Solving Sudoku with Consistency: A Visual and Interactive Approach

Autor: Christian Bessiere, Robert J. Woodward, Ian S. Howell, Berthe Y. Choueiry

We describe an online, interactive system with a graphical interface to illustrate the power and operation of consistency algorithms in a friendly and popular context, namely, solving Sudoku puzzles. Our tool implements algorithms for enforcing five

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::99462928321092931db7bd559cf8429f
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01897933/file/0852.pdf

Zobrazit plný text záznamu

Correction to: PW-CT: Extending Compact-Table to Enforce Pairwise Consistency on Table Constraints

Autor: Anthony Schneider, Berthe Y. Choueiry

Publikováno v: Lecture Notes in Computer Science ISBN: 9783319983332

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ae833850bb4b252c46ce2a996b8880ed
https://doi.org/10.1007/978-3-319-98334-9_48

Zobrazit plný text záznamu

PW-CT: Extending Compact-Table to Enforce Pairwise Consistency on Table Constraints

Autor: Berthe Y. Choueiry, Anthony Schneider

Publikováno v: Lecture Notes in Computer Science ISBN: 9783319983332
CP

The Compact-Table (CT) algorithm is the current state-of-the-art algorithm for enforcing Generalized Arc Consistency (GAC) on table constraints during search. Recently, algorithms for enforcing Pairwise Consistency (PWC), which is strictly stronger t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2f92f4085c764c1aa2b4a60630499a89
https://doi.org/10.1007/978-3-319-98334-9_23

Zobrazit plný text záznamu

Towards a practical theory of reformulation for reasoning about physical systems

Autor: Berthe Y. Choueiry, Yumi Iwasaki, Sheila A. McIlraith

Publikováno v: Artificial Intelligence. 162(1-2):145-204

Reformulation is ubiquitous in problem solving and is especially common in modeling physical systems. In this paper we examine reformulation techniques in the context of reasoning about physical systems. This paper does not present a general theory o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::776b8407cbb22e830810b8ebaa1ffbce

Zobrazit plný text záznamu

Abstraction and reformulation in artificial intelligence

Autor: Berthe Y. Choueiry, Robert C. Holte

Publikováno v: Philosophical Transactions of the Royal Society of London. Series B: Biological Sciences. 358:1197-1204

This paper contributes in two ways to the aims of this special issue on abstraction. The first is to show that there are compelling reasons motivating the use of abstraction in the purely computational realm of artificial intelligence. The second is

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6b5986fd9f3c16f3d1b8e08c05dc482
https://doi.org/10.1098/rstb.2003.1317

Zobrazit plný text záznamu

Improving Relational Consistency Algorithms Using Dynamic Relation Partitioning

Autor: Robert J. Woodward, Berthe Y. Choueiry, Christian Bessiere, Anthony Schneider

Publikováno v: 20th International Conference on Principles and Practice of Constraint Programming
CP: Principles and Practice of Constraint Programming
CP: Principles and Practice of Constraint Programming, Sep 2014, Lyon, France. pp.688-704, ⟨10.1007/978-3-319-10428-7_50⟩
Lecture Notes in Computer Science ISBN: 9783319104270
CP

International audience; Relational consistency algorithms are instrumental for solving difficult instances of Constraint Satisfaction Problems (CSPs), often allowing backtrack-free search. In this paper, we improve an algorithm for enforcing relation

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f806a979bb8f485e142a9d6e524ffd57
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01067437

Zobrazit plný text záznamu

Adaptive Parameterized Consistency for Non-Binary CSPs by Counting Supports

Autor: Berthe Y. Choueiry, Christian Bessiere, Anthony Schneider, Robert J. Woodward

Publikováno v: 20th International Conference on Principles and Practice of Constraint Programming
CP: Principles and Practice of Constraint Programming
CP: Principles and Practice of Constraint Programming, Sep 2014, Lyon, France. pp.755-764, ⟨10.1007/978-3-319-10428-7_54⟩
Lecture Notes in Computer Science ISBN: 9783319104270
CP

International audience; Determining the appropriate level of local consistency to en- force on a given instance of a Constraint Satisfaction Problem (CSP) is not an easy task. However, selecting the right level may determine our ability to solve the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d64ae8b3761c0f94c09083ebca4b632
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01067342/file/cp14-adaptive.pdf

Zobrazit plný text záznamu

Revisiting Neighborhood Inverse Consistency on Binary CSPs

Autor: Robert J. Woodward, Berthe Y. Choueiry, Christian Bessiere, Shant Karakashian

Publikováno v: 18th International Conference on Principles and Practice of Constraint Programming
CP: Principles and Practice of Constraint Programming
CP: Principles and Practice of Constraint Programming, Oct 2012, Québec City, Canada. pp.688-703
Lecture Notes in Computer Science ISBN: 9783642335570
CP

International audience; Our goal is to investigate the definition and application of strong consistency properties on the dual graphs of binary Constraint Satisfaction Problems (CSPs). As a first step in that direction, we study the structure of the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7203ffc9b923ba3addfa677a49f06f3e
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00748179

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání