Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Tuhin Sahai"'
Publikováno v:
Complexity, Vol 2019 (2019)
We introduce a new measure of complexity (called spectral complexity) for directed graphs. We start with splitting of the directed graph into its recurrent and nonrecurrent parts. We define the spectral complexity metric in terms of the spectrum of t
Externí odkaz:
https://doaj.org/article/f757da0f6ec0451eadaa337dc99be0ac
Publikováno v:
IRC
The secure command and control (C&C) of mobile agents arises in various settings including unmanned aerial vehicles, single pilot operations in commercial settings, and mobile robots to name a few. As more and more of these applications get integrate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c37a5e93a437de8dd4db00e33a3992b
https://doi.org/10.1109/irc.2020.00012
https://doi.org/10.1109/irc.2020.00012
Autor:
Tuhin Sahai
Publikováno v:
Advances in Dynamics, Optimization and Computation ISBN: 9783030512637
This article surveys the burgeoning area at the intersection of dynamical systems theory and algorithms for NP-hard problems. Traditionally, computational complexity and the analysis of non-deterministic polynomial-time (NP)-hard problems have fallen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fb06923d9718af22717c6e294ed0673
https://doi.org/10.1007/978-3-030-51264-4_8
https://doi.org/10.1007/978-3-030-51264-4_8
Publikováno v:
Journal of Automated Reasoning. 63:1055-1075
In this paper, we consider the problem of learning Boolean formulae from examples obtained by actively querying an oracle that can label these examples as either positive or negative. This problem has received attention in both machine learning as we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d27e3fcbf3c42eadad2e027ce964f1ef
https://doi.org/10.1007/s10817-018-9499-8
https://doi.org/10.1007/s10817-018-9499-8
Publikováno v:
IFAC-PapersOnLine. 50:10760-10765
Can a dynamical system paint masterpieces such as Da Vinci’s Mona Lisa or Monet’s Water Lilies? Moreover, can this dynamical system be chaotic in the sense that although the trajectories are sensitive to initial conditions, the same painting is c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::658c0a30d1aecd96098a8c9be3bee78a
https://doi.org/10.1016/j.ifacol.2017.08.2278
https://doi.org/10.1016/j.ifacol.2017.08.2278
Publikováno v:
Formal Methods in System Design, vol 54, iss 3
We propose a novel passive learning approach, TeLex, to infer signal temporal logic (STL) formulas that characterize the behavior of a dynamical system using only observed signal traces of the system. First, we present a template-driven learning appr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a8fbbe4e67917c64a556dd079f0ba46
https://escholarship.org/uc/item/5sj2g464
https://escholarship.org/uc/item/5sj2g464
Publikováno v:
Scopus-Elsevier
AAAI
AAAI
Given a Boolean formula ϕ(x) in conjunctive normal form (CNF), the density of states counts the number of variable assignments that violate exactly e clauses, for all values of e. Thus, the density of states is a histogram of the number of unsatisfi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7be33b59ad41178cc7e3b9cc7d5ca458
Autor:
Stefan Klus, Tuhin Sahai
Publikováno v:
Information and Inference: A Journal of the IMA.
In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can be isospe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18a004f90a9915b06186eb3c69f21d68
https://doi.org/10.1093/imaiai/iay001
https://doi.org/10.1093/imaiai/iay001
Publikováno v:
2018 AIAA Non-Deterministic Approaches Conference.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e024640be2d253b03095819ece510de2
https://doi.org/10.2514/6.2018-1181
https://doi.org/10.2514/6.2018-1181
In this work, we aim to explore connections between dynamical systems techniques and combinatorial optimization problems. In particular, we construct heuristic approaches for the traveling salesman problem (TSP) based on embedding the relaxed discret
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94326611a40977b9b309a979864a13fa
http://arxiv.org/abs/1702.05224
http://arxiv.org/abs/1702.05224