Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Iyad A. Kanj"'
Autor:
Eduard Eiben, Iyad A. Kanj
Publikováno v:
ACM Transactions on Algorithms. 16:1-48
Given a set of obstacles and two points in the plane, is there a path between the two points that does not cross more than k different obstacles? Equivalently, can we remove k obstacles so that there is an obstacle-free path between the two designate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::60767d0576d8d4c4c87633590f20f033
https://doi.org/10.1145/3396573
https://doi.org/10.1145/3396573
Publikováno v:
AAAI
We consider a fundamental matrix completion problem where we are given an incomplete matrix and a set of constraints modeled as a CSP instance. The goal is to complete the matrix subject to the input constraints and in such a way that the complete ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42b71bdc5425e7423cd305f3595c3b32
https://doi.org/10.1609/aaai.v34i04.5804
https://doi.org/10.1609/aaai.v34i04.5804
Publikováno v:
AAAI
We study the problem of covering a 3-dimensional terrain by a sweeping robot that is equipped with a camera. We model the terrain as a mesh in a way that captures the elevation levels of the terrain; this enables a graph-theoretic formulation of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2196bc399c8467b7e4f2abd251de9807
https://doi.org/10.1609/aaai.v34i06.6603
https://doi.org/10.1609/aaai.v34i06.6603
Publikováno v:
ICRA
Continuum arms are more adaptable to their environments and inherently human-friendly compared to their rigid counterparts. Path planning of continuum arms is an active research area with many challenges. The hyper-redundancy of continuum arms, which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08aed3d718efadf60866c813eb21d901
https://doi.org/10.1109/icra48506.2021.9560952
https://doi.org/10.1109/icra48506.2021.9560952
Publikováno v:
ICRA
Continuum arms, with their mix of compliance, payload, safety, and manipulability, are perfectly suited to serve as co-robots, and their applications range from industry and manufacturing to human healthcare. Their hyper-redundancy serves as their mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a37c8f486ed7a3ca3eaef7094d54709a
https://doi.org/10.1109/icra48506.2021.9560982
https://doi.org/10.1109/icra48506.2021.9560982
Publikováno v:
ACM Transactions on Computation Theory, 12(4):22. Association for Computing Machinery (ACM)
Impagliazzo et al. proposed a framework, based on the logic fragment defining the complexity class SNP, to identify problems that are equivalent to k -CNF- Sat modulo subexponential-time reducibility (serf-reducibility). The subexponential-time solva
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b5ba19a54a11af7eb6ee5d13bf6ca5a
https://dare.uva.nl/personal/pure/en/publications/on-existential-mso-and-its-relation-to-eth(dc7802f4-48bb-47ab-8f73-eb4b2da178df).html
https://dare.uva.nl/personal/pure/en/publications/on-existential-mso-and-its-relation-to-eth(dc7802f4-48bb-47ab-8f73-eb4b2da178df).html
Publikováno v:
SIAM Journal on Discrete Mathematics
Proceedings of the 26th Annual European Symposium on Algorithms (ESA 18)
Proceedings of the 26th Annual European Symposium on Algorithms (ESA '18)
Proceedings of the 26th Annual European Symposium on Algorithms (ESA 18)
Proceedings of the 26th Annual European Symposium on Algorithms (ESA '18)
A fundamental graph problem is to recognize whether the vertex set of a graph $G$ can be bipartitioned into sets $A$ and $B$ such that $G[A]$ and $G[B]$ satisfy properties $\Pi_A$ and $\Pi_B$, respectively. This so-called $(\Pi_A,\Pi_B)$-Recognition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::053f041cd75de15080173e349ec7f9ac
Publikováno v:
RoboSoft
We study the path planning problem for continuum-arm robots, in which we are given a starting and an end point, and we need to compute a path for the tip of the continuum arm between the two points. We consider both cases where obstacles are present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f653dcc64d6365c0248def186cdb143
https://doi.org/10.1109/robosoft.2019.8722778
https://doi.org/10.1109/robosoft.2019.8722778
Autor:
Stefan Szeider, Iyad A. Kanj
Publikováno v:
Theoretical Computer Science. 607:282-295
We study the parameterized and the subexponential-time complexity of the weighted and the unweighted satisfiability problems on bounded-depth normalized Boolean circuits. We establish relations between the subexponential-time complexity of the weight
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2124e87f9ac4211be609858415a2198a
https://doi.org/10.1016/j.tcs.2015.08.029
https://doi.org/10.1016/j.tcs.2015.08.029
Publikováno v:
ACM Transactions on Computational Logic, 18(3):21. Association for Computing Machinery (ACM)
In many practical settings it is useful to find a small unsatisfiable subset of a given unsatisfiable set of constraints. We study this problem from a parameterized complexity perspective, taking the size of the unsatisfiable subset as the natural pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02e142f2e7a6db1a6a720714b9f14e27
https://dare.uva.nl/personal/pure/en/publications/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances(7c229384-d41c-4195-92d6-1b5e24f18dd6).html
https://dare.uva.nl/personal/pure/en/publications/on-the-parameterized-complexity-of-finding-small-unsatisfiable-subsets-of-cnf-formulas-and-csp-instances(7c229384-d41c-4195-92d6-1b5e24f18dd6).html
