Zobrazeno 1 - 10 of 187 pro vyhledávání: '"Complexitat computacional"'
1
Acceleration of Born Series by Change of Variables
Autor: Hector Lopez-Menchon, Alexander Heldring, Eduard Ubeda, Juan M. Rius
Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
In this work, we propose a method to enhance the convergence of the Born series. The Born series is widely used in scattering theory, but its convergence is only guaranteed under certain restrictive conditions which limit the cases where this formula
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::df36b40ff375270e35172bf187d4e40f
https://doi.org/10.1109/tap.2021.3060834
Zobrazit plný text záznamu
2
Low-Rank Matrix Factorization Method for Multiscale Simulations: A Review
Autor: Mengmeng Li, Giuseppe Vecchi, Jun Hu, Dazhi Ding, Rushan Chen, Alexander Heldring
Publikováno v: IEEE Open Journal of Antennas and Propagation, Vol 2, Pp 286-301 (2021)
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
In this paper, a review of the low-rank factorization method is presented, with emphasis on their application to multiscale problems. Low-rank matrix factorization methods exploit the rankdeficient nature of coupling impedance matrix blocks between t
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4dda0b72432d2453d1151d87404ef9fa
https://ieeexplore.ieee.org/document/9361699/
Zobrazit plný text záznamu
3
Frege Systems for Quantified Boolean Logic
Autor: Olaf Beyersdorff, Ilario Bonacina, Ján Pich, Leroy Chew
Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
We define and investigate Frege systems for quantified Boolean formulas (QBF). For these new proof systems, we develop a lower bound technique that directly lifts circuit lower bounds for a circuit class C to the QBF Frege system operating with lines
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1a71059526abcfaa4d32b866518de6d
https://doi.org/10.1145/3381881
Zobrazit plný text záznamu
4
On the power of symmetric linear programs
Autor: Anuj Dawar, Joanna Ochremiak, Albert Atserias
Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2019, Vancouver, Canada. pp.1-13, ⟨10.1109/LICS.2019.8785792⟩
LICS
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer points correspon
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::746f4967e59efa125e18ded72e4757f5
https://hdl.handle.net/2117/384806
Zobrazit plný text záznamu
5
Measuring satisfaction and power in influence based decision systems
Autor: Xavier Molinero, Maria Serna, Fabián Riquelme
Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
We introduce collective decision-making models associated with influence spread under the linear threshold model in social networks. We define the oblivious and the non-oblivious influence models. We also introduce the generalized opinion leader–fo
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1ceee8b7f8583861cce3325eecba0f8
https://doi.org/10.1016/j.knosys.2019.03.005
Zobrazit plný text záznamu
7
Some results of Maria Serna on strategic games: Complexity of equilibria and models
Autor: Carme Àlvarez, Amalia Duch
Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
We survey some recent work of Maria Serna concerning strategic games. We first examine some results related to the formal representation of strategic games and the complexity of problems related to both the existence of equilibria and the equivalence
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5f7e4e51b064d9ef047e5fd9df418123
http://hdl.handle.net/2117/362998
Zobrazit plný text záznamu
8
Best response computation: efficient algorithm to compute the best response for strategic network formation with attack and immunization
Autor: Zhang, Niebo
Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
En aquest projecte, ens centrem en investigar el model de Network Creation Games with attack and immunization introduït per Goyal et al.. Freqüentment, el cost computacional de computar una Best Response o de comprovar si s’arriba a un equilibri
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ce4d69403be1586b8d8a994fbbb29806
http://hdl.handle.net/2117/350198
Zobrazit plný text záznamu
9
Joint beam-hopping scheduling and power allocation in NOMA-assisted satellite systems
Autor: Ana Isabel Perez Neira, Symeon Chatzinotas, Anyue Wang, Eva Lagunas, Lei Lei, Bjorn Ottersten
Publikováno v: WCNC
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
In this paper, we investigate potential synergies of non-orthogonal multiple access (NOMA) and beam hopping (BH) for multi-beam satellite systems. The coexistence of BH and NOMA provides time-power-domain flexibilities in mitigating a practical misma
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed0ab83c364b1920a94c35bef7661f77
https://hdl.handle.net/2117/354167
Zobrazit plný text záznamu
10
Structure and Complexity of Bag Consistency
Autor: Albert Atserias, Phokion G. Kolaitis
Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
PODS
Since the early days of relational databases, it was realized that acyclic hypergraphs give rise to database schemas with desirable structural and algorithmic properties. In a by-now classical paper, Beeri, Fagin, Maier, and Yannakakis established se
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::698bceb8915300b1803cf7985d796ef6
http://arxiv.org/abs/2012.12126
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje