Zobrazeno 1 - 10
of 71
pro vyhledávání: '"de la Banda, Maria Garcia"'
Autor:
Cai, Zhixi, Cardenas, Cristian Rojas, Leo, Kevin, Zhang, Chenyuan, Backman, Kal, Li, Hanbing, Li, Boying, Ghorbanali, Mahsa, Datta, Stavya, Qu, Lizhen, Santiago, Julian Gutierrez, Ignatiev, Alexey, Li, Yuan-Fang, Vered, Mor, Stuckey, Peter J, de la Banda, Maria Garcia, Rezatofighi, Hamid
This paper addresses the problem of autonomous UAV search missions, where a UAV must locate specific Entities of Interest (EOIs) within a time limit, based on brief descriptions in large, hazard-prone environments with keep-out zones. The UAV must pe
Externí odkaz:
http://arxiv.org/abs/2409.10196
Autor:
Rajapaksa, Sandun, Allison, Lloyd, Stuckey, Peter J., de la Banda, Maria Garcia, Konagurthu, Arun S.
A complete time-parameterized statistical model quantifying the divergent evolution of protein structures in terms of the patterns of conservation of their secondary structures is inferred from a large collection of protein 3D structure alignments. T
Externí odkaz:
http://arxiv.org/abs/2308.06292
Autor:
Albert, Elvira, de la Banda, Maria Garcia, Gómez-Zamalloa, Miguel, Isabel, Miguel, Stuckey, Peter
Publikováno v:
In The Journal of Systems & Software August 2023 202
Autor:
Belov, Gleb, Cohen, Liron, de la Banda, Maria Garcia, Harabor, Daniel, Koenig, Sven, Wei, Xinrui
The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision-free paths for a number of agents, from a set of start locations to a set of goal positions in a known 2D environment. MAPF has been studied in theoretical computer science, rob
Externí odkaz:
http://arxiv.org/abs/1905.08412
Publikováno v:
Theory and Practice of Logic Programming 14 (2014) 363-377
The rules of Sudoku are often specified using twenty seven \texttt{all\_different} constraints, referred to as the {\em big} \mrules. Using graphical proofs and exploratory logic programming, the following main and new result is obtained: many subset
Externí odkaz:
http://arxiv.org/abs/1207.5926
Taylor introduced a variable binding scheme for logic variables in his PARMA system, that uses cycles of bindings rather than the linear chains of bindings used in the standard WAM representation. Both the HAL and dProlog languages make use of the PA
Externí odkaz:
http://arxiv.org/abs/cs/0505085
Publikováno v:
Theory and Practice of Logic Programming: 5(6):623-668, 2005
Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generation of efficient target code and the detection of many errors at compile-
Externí odkaz:
http://arxiv.org/abs/cs/0409038
Publikováno v:
Theory and Practice of Logic Programming: 5(4-5):503-532, 2005
In this paper we discuss the optimizing compilation of Constraint Handling Rules (CHRs). CHRs are a multi-headed committed choice constraint language, commonly applied for writing incremental constraint solvers. CHRs are usually implemented as a lang
Externí odkaz:
http://arxiv.org/abs/cs/0408025
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.