Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Marlene Arangú"'
Publikováno v:
Journal of Scheduling. 12:227-256
Planning research is recently concerned with the resolution of more realistic problems as evidenced in the many works and new extensions to the Planning Domain Definition Language (PDDL) to better approximate real problems. Researchers’ works to pu
Publikováno v:
Engineering Applications of Artificial Intelligence. 21:698-709
Distributed or multi-agent planning extends classical AI planning to domains where several agents can plan and act together. There exist many recent developments in this discipline that range over different approaches for distributed planning algorit
Autor:
Miguel A. Salido, Marlene Arangú
Publikováno v:
CLEI
Most arc-consistency algorithms take for granted that CSPs are binary (all constraints involve two variables) and normalized (two different constraints do not involve exactly the same variables). When these algorithms perform pruning of values, propa
Autor:
Miguel A. Salido, Marlene Arangú
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
Constraint programming is a powerful software technology for solving numerous real-life problems. Many of these problems can be modeled as Constraint Satisfaction Problems (CSPs) and solved using constraint programming techniques. However, solving a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d85dbb478700c1b0793f99c1f2d5eb42
https://doi.org/10.2478/v10006-011-0058-2
https://doi.org/10.2478/v10006-011-0058-2
Publikováno v:
Trends in Applied Intelligent Systems ISBN: 9783642130328
IEA/AIE (3)
IEA/AIE (3)
Many real life problems can be modeled as constraint satisfaction problems (CSPs) and be solved using constraint programming techniques. In broad domains, consistency techniques become an important issue important since they can prune the search spac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfe31e1000ce2f0d49cb4115da946a6f
https://doi.org/10.1007/978-3-642-13033-5_23
https://doi.org/10.1007/978-3-642-13033-5_23
Publikováno v:
ICTAI
Nowadays, many real problems can be modeled as constraint satisfaction problems. Arc consistency algorithms are widely used to prune the search space of Constraint Satisfaction. In this paper we present a new algorithm, called 2-C3OP, that achieves 2
Publikováno v:
Research and Development in Intelligent Systems XXVI ISBN: 9781848829824
Arc-consistency algorithms are widely used to prune the search space of CSPs. Two of the most well-known and frequently used arc-consistency algorithms for filtering CSPs are AC3 and AC4. These algorithms repeatedly carry out revisions and they requi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34479dd6e850b4bc06f132e2e8dc7588
https://doi.org/10.1007/978-1-84882-983-1_24
https://doi.org/10.1007/978-1-84882-983-1_24
Publikováno v:
ICTAI (1)
In real world we have to deal with changing situations which may partially or entirely invalidate an executable plan. Current strategies for plan repair are basically aimed at solving problems where regular minor modifications in the initial or goal