Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Berthe Choueiry"'
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 31
We propose to exploit cycles in the constraint network of a Constraint Satisfaction Problem (CSP) to vehicle constraint propagation and improve the effectiveness of local consistency algorithms. We focus our attention on the consistency property Part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6090c5e2097bef17ac046808647ccc67
https://doi.org/10.1609/aaai.v31i1.11101
https://doi.org/10.1609/aaai.v31i1.11101
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 27:466-473
The tractability of a Constraint Satisfaction Problem (CSP)is guaranteed by a direct relationship between its consistencylevel and a structural parameter of its constraint network suchas the treewidth. This result is not widely exploited in practiceb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e72cfed0d4fb5dcfb16b08eba2c7b0ad
https://doi.org/10.1609/aaai.v27i1.8594
https://doi.org/10.1609/aaai.v27i1.8594
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 25:112-119
Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) as a strong local consistency property for binary CSPs. While enforcing NIC can significantly filter the variables domains, the proposed algorithm is too costly to be used on d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a9320e68b581611c3666f44a7882f18
https://doi.org/10.1609/aaai.v25i1.7825
https://doi.org/10.1609/aaai.v25i1.7825
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 29
In Constraint Processing, many algorithms for enforcing the same level of local consistency may exist. The performance of those algorithms varies widely. In order to understand what problem features lead to better performance of one algorithm over an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::506a1b9286226fe24bf6e615ac099d64
https://doi.org/10.1609/aaai.v29i1.9728
https://doi.org/10.1609/aaai.v29i1.9728
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 27:1611-1612
Computing the minimal network of a Constraint Satisfaction Problem (CSP) is a useful and difficult task. Two algorithms, PerTuple and AllSol, were proposed to this end. The performances of these algorithms vary with the problem instance. We use Machi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94b8418798eb309d6b7a15cc141c76c3
https://doi.org/10.1609/aaai.v27i1.8532
https://doi.org/10.1609/aaai.v27i1.8532
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 25:1830-1831
Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) for binary CSPs. In this paper, we introduce RNIC, the extension of NIC to non-binary CSPs, and describe a practical algorithm for enforcing it. We propose an adaptive strategy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::25210561798551193d5eb37a1604869c
https://doi.org/10.1609/aaai.v25i1.8059
https://doi.org/10.1609/aaai.v25i1.8059
Autor:
Stern, Tomer1,2 (AUTHOR) efw@princeton.edu, Shvartsman, Stanislav Y.2,3,4 (AUTHOR), Wieschaus, Eric F.1,3 (AUTHOR) efw@princeton.edu
Publikováno v:
PLoS Computational Biology. 8/21/2020, Vol. 16 Issue 8, p1-20. 20p. 1 Chart, 4 Graphs.
Publikováno v:
Thirteenth International Symposium on Temporal Representation & Reasoning (TIME'06); 2006, pviii-viii, 1p
Publikováno v:
Proceedings 2003 International Conference on Cyberworlds; 2003, p62-68, 7p
Publikováno v:
Paladyn: Journal of Behavioral Robotics; Jun2011, Vol. 2 Issue 2, p71-81, 11p