受强制性开放获取政策约束的文章 - Khaled Elbassioni了解详情
无法在其他位置公开访问的文章：2 篇
Jamming-based covert communication for rate-splitting multiple access
TT Nguyen, NC Luong, S Feng, K Elbassioni, D Niyato
IEEE Transactions on Vehicular Technology 72 (8), 11074-11079, 2023
强制性开放获取政策： National Research Foundation, Singapore
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden subgames
E Boros, K Elbassioni, V Gurvich, K Makino, V Oudalov
International journal of game theory 45, 1111-1131, 2016
强制性开放获取政策： US National Science Foundation
可在其他位置公开访问的文章：14 篇
Markov decision processes and stochastic games with total effective payoff
E Boros, K Elbassioni, V Gurvich, K Makino
Annals of Operations Research, 1-29, 2018
强制性开放获取政策： US National Science Foundation
Conflict-free coloring for rectangle ranges using O (n. 382) colors
D Ajwani, K Elbassioni, S Govindarajan, S Ray
Discrete & Computational Geometry 48 (1), 39-52, 2012
强制性开放获取政策： Danish National Research Foundation
A convex programming-based algorithm for mean payoff stochastic games with perfect information
E Boros, K Elbassioni, V Gurvich, K Makino
Optimization Letters 11, 1499-1512, 2017
强制性开放获取政策： Federal Ministry of Education and Research, Germany
A potential reduction algorithm for two-person zero-sum mean payoff stochastic games
E Boros, K Elbassioni, V Gurvich, K Makino
Dynamic games and applications 8 (1), 22-41, 2018
强制性开放获取政策： US National Science Foundation
Polynomial-time alternating probabilistic bisimulation for interval MDPs
V Hashemi, A Turrini, EM Hahn, H Hermanns, K Elbassioni
International Symposium on Dependable Software Engineering: Theories, Tools …, 2017
强制性开放获取政策： 中国科学院, 国家自然科学基金委员会
A nested family of k k-total effective rewards for positional games
E Boros, K Elbassioni, V Gurvich, K Makino
International journal of game theory 46, 263-293, 2017
强制性开放获取政策： US National Science Foundation, Federal Ministry of Education and Research …
Complexity of approximating the vertex centroid of a polyhedron
K Elbassioni, HR Tiwary
Theoretical computer science 421, 56-61, 2012
强制性开放获取政策： German Research Foundation
A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem
S Canzar, K Elbassioni, J Mestre
Journal of Experimental Algorithmics (JEA) 18, 2.1-2.19, 2013
强制性开放获取政策： US National Institutes of Health
Sphetcher: spherical thresholding improves sketching of single-cell transcriptomic heterogeneity
K Elbassioni, S Canzar
Iscience 23 (6), 2020
强制性开放获取政策： German Research Foundation
Joint Rate Allocation and Power Control for RSMA-Based Communication and Radar Coexistence Systems
TT Nguyen, NC Luong, S Feng, TH Nguyen, K Elbassioni, D Niyato, ...
IEEE Transactions on Vehicular Technology 72 (11), 14673-14687, 2023
强制性开放获取政策： 国家自然科学基金委员会, National Research Foundation, Singapore
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions
E Boros, K Elbassioni, M Fouz, V Gurvich, K Makino, B Manthey
Algorithmica 80, 3132-3157, 2018
强制性开放获取政策： US National Science Foundation, Federal Ministry of Education and Research …
Approximation algorithms for the interval constrained coloring problem
E Althaus, S Canzar, K Elbassioni, A Karrenbauer, J Mestre
Algorithmica 61, 342-361, 2011
强制性开放获取政策： German Research Foundation
Generating clause sequences of a CNF formula
K Bérczi, E Boros, O Čepek, K Elbassioni, P Kučera, K Makino
Theoretical computer science 856, 68-74, 2021
强制性开放获取政策： Magyar Tudományos Akadémia, National Office for Research, Development and …
Complexity of approximating the vertex centroid of a polyhedron
K Elbassioni, HR Tiwary
International Symposium on Algorithms and Computation, 413-422, 2009
强制性开放获取政策： German Research Foundation
出版信息和资助信息由计算机程序自动确定