Статті в журналах з теми "Parameterised complexity analysis"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Parameterised complexity analysis".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Corus, Dogan, Per Kristian Lehre, Frank Neumann, and Mojgan Pourhassan. "A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms." Evolutionary Computation 24, no. 1 (March 2016): 183–203. http://dx.doi.org/10.1162/evco_a_00147.
Повний текст джерелаCreignou, Nadia, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, and Heribert Vollmer. "Parameterised Enumeration for Modification Problems." Algorithms 12, no. 9 (September 9, 2019): 189. http://dx.doi.org/10.3390/a12090189.
Повний текст джерелаAghighi, Meysam, and Christer Backstrom. "A Multi-Parameter Complexity Analysis of Cost-Optimal and Net-Benefit Planning." Proceedings of the International Conference on Automated Planning and Scheduling 26 (March 30, 2016): 2–10. http://dx.doi.org/10.1609/icaps.v26i1.13738.
Повний текст джерелаNOUY, A., and C. SOIZE. "Random field representations for stochastic elliptic boundary value problems and statistical inverse problems." European Journal of Applied Mathematics 25, no. 3 (March 21, 2014): 339–73. http://dx.doi.org/10.1017/s0956792514000072.
Повний текст джерелаSmallman, Thomas Luke, David Thomas Milodowski, Eráclito Sousa Neto, Gerbrand Koren, Jean Ometto, and Mathew Williams. "Parameter uncertainty dominates C-cycle forecast errors over most of Brazil for the 21st century." Earth System Dynamics 12, no. 4 (November 23, 2021): 1191–237. http://dx.doi.org/10.5194/esd-12-1191-2021.
Повний текст джерелаBodlaender, H. L., R. G. Downey, M. R. Fellows, M. T. Hallett, and H. T. Wareham. "Parameterized complexity analysis in computational biology." Bioinformatics 11, no. 1 (1995): 49–57. http://dx.doi.org/10.1093/bioinformatics/11.1.49.
Повний текст джерелаWitteveen, Jouke, and Leen Torenvliet. "Fixed-parameter decidability: Extending parameterized complexity analysis." Mathematical Logic Quarterly 62, no. 6 (November 15, 2016): 596–607. http://dx.doi.org/10.1002/malq.201500077.
Повний текст джерелаFellows, Michael, Andreas Pfandler, Frances Rosamond, and Stefan Rümmele. "The Parameterized Complexity of Abduction." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 743–49. http://dx.doi.org/10.1609/aaai.v26i1.8224.
Повний текст джерелаBäckström, Christer, Yue Chen, Peter Jonsson, Sebastian Ordyniak, and Stefan Szeider. "The Complexity of Planning Revisited — A Parameterized Analysis." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 1735–41. http://dx.doi.org/10.1609/aaai.v26i1.8361.
Повний текст джерелаBäckström, Christer, Peter Jonsson, Sebastian Ordyniak, and Stefan Szeider. "A complete parameterized complexity analysis of bounded planning." Journal of Computer and System Sciences 81, no. 7 (November 2015): 1311–32. http://dx.doi.org/10.1016/j.jcss.2015.04.002.
Повний текст джерелаDe Haan, Ronald, Anna Roubickova, and Stefan Szeider. "Parameterized Complexity Results for Plan Reuse." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 30, 2013): 224–31. http://dx.doi.org/10.1609/aaai.v27i1.8655.
Повний текст джерелаMeier, Arne. "Incremental FPT Delay." Algorithms 13, no. 5 (May 15, 2020): 122. http://dx.doi.org/10.3390/a13050122.
Повний текст джерелаBannach, Max, and Till Tantau. "On the Descriptive Complexity of Color Coding." Algorithms 14, no. 3 (March 19, 2021): 96. http://dx.doi.org/10.3390/a14030096.
Повний текст джерелаJaffke, Lars, and Bart M. P. Jansen. "Fine-grained parameterized complexity analysis of graph coloring problems." Discrete Applied Mathematics 327 (March 2023): 33–46. http://dx.doi.org/10.1016/j.dam.2022.11.011.
Повний текст джерелаHaan, Ronald de, and Stefan Szeider. "A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy." Algorithms 12, no. 9 (September 9, 2019): 188. http://dx.doi.org/10.3390/a12090188.
Повний текст джерелаOrdyniak, Sebastian, and Stefan Szeider. "Parameterized Complexity of Small Decision Tree Learning." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 7 (May 18, 2021): 6454–62. http://dx.doi.org/10.1609/aaai.v35i7.16800.
Повний текст джерелаGrüttemeier, Niels, and Christian Komusiewicz. "Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis." Journal of Artificial Intelligence Research 74 (July 10, 2022): 1225–67. http://dx.doi.org/10.1613/jair.1.13138.
Повний текст джерелаHermelin, Danny, and Liat Rozenberg. "Parameterized complexity analysis for the Closest String with Wildcards problem." Theoretical Computer Science 600 (October 2015): 11–18. http://dx.doi.org/10.1016/j.tcs.2015.06.043.
Повний текст джерелаBentert, Matthias, Robert Bredereck, Péter Györgyi, Andrzej Kaczmarczyk, and Rolf Niedermeier. "A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 13 (May 18, 2021): 11755–63. http://dx.doi.org/10.1609/aaai.v35i13.17397.
Повний текст джерелаFeldmann, Andreas Emil, Karthik C. Karthik C. S., Euiwoong Lee, and Pasin Manurangsi. "A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms." Algorithms 13, no. 6 (June 19, 2020): 146. http://dx.doi.org/10.3390/a13060146.
Повний текст джерелаBulteau, Laurent, and Mathias Weller. "Parameterized Algorithms in Bioinformatics: An Overview." Algorithms 12, no. 12 (December 1, 2019): 256. http://dx.doi.org/10.3390/a12120256.
Повний текст джерелаChitnis, Rajesh, MohammadTaghi Hajiaghayi, and Vahid Liaghat. "Parameterized Complexity of Problems in Coalitional Resource Games." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (August 4, 2011): 620–25. http://dx.doi.org/10.1609/aaai.v25i1.7887.
Повний текст джерелаGodber, O. F., M. Chentouf, and R. Wall. "Sustainable goat production: modelling optimal performance in extensive systems." Animal Production Science 60, no. 6 (2020): 843. http://dx.doi.org/10.1071/an18481.
Повний текст джерелаDexter, Nick, Hoang Tran та Clayton Webster. "A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs". ESAIM: Mathematical Modelling and Numerical Analysis 53, № 6 (листопад 2019): 2025–45. http://dx.doi.org/10.1051/m2an/2019048.
Повний текст джерелаFichte, Johannes. "Backdoors to Tractability of Answer-Set Programming." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 29, 2013): 1662–63. http://dx.doi.org/10.1609/aaai.v27i1.8505.
Повний текст джерелаBredereck, Robert, Jiehua Chen, Sepp Hartung, Rolf Niedermeier, Ondřej Suchý, and Stefan Kratsch. "A Multivariate Complexity Analysis of Lobbying in Multiple Referenda." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 1292–98. http://dx.doi.org/10.1609/aaai.v26i1.8248.
Повний текст джерелаMisra, Neeldhara, Frances Rosamond, and Meirav Zehavi. "Special Issue “New Frontiers in Parameterized Complexity and Algorithms”: Foreward by the Guest Editors." Algorithms 13, no. 9 (September 18, 2020): 236. http://dx.doi.org/10.3390/a13090236.
Повний текст джерелаLin, Mugang, Jianxin Wang, Qilong Feng, and Bin Fu. "Randomized Parameterized Algorithms for the Kidney Exchange Problem." Algorithms 12, no. 2 (February 25, 2019): 50. http://dx.doi.org/10.3390/a12020050.
Повний текст джерелаZhang, Jian Hua, Dian Wei Gao, Ke Sun, and Xin Sheng Liu. "Parameterized Modeling and Analysis of Wind Turbine Blade Using VB and ANSYS." Advanced Materials Research 774-776 (September 2013): 248–51. http://dx.doi.org/10.4028/www.scientific.net/amr.774-776.248.
Повний текст джерелаBoehmer, Niclas, Robert Bredereck, Klaus Heeger, and Rolf Niedermeier. "Bribery and Control in Stable Marriage." Journal of Artificial Intelligence Research 71 (August 24, 2021): 993–1048. http://dx.doi.org/10.1613/jair.1.12755.
Повний текст джерелаBouafia, Mousaab, Djamel Benterki, and Adnan Yassine. "Complexity analysis of interior point methods for linear programming based on a parameterized kernel function." RAIRO - Operations Research 50, no. 4-5 (October 2016): 935–49. http://dx.doi.org/10.1051/ro/2015056.
Повний текст джерелаBoudjellal, Nawel, Hayet Roumili, and Djamel Benterki. "Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function." Boletim da Sociedade Paranaense de Matemática 40 (February 2, 2022): 1–16. http://dx.doi.org/10.5269/bspm.47772.
Повний текст джерелаAbu-Khzam, Faisal N., and Karam Al Kontar. "A Brief Survey of Fixed-Parameter Parallelism." Algorithms 13, no. 8 (August 14, 2020): 197. http://dx.doi.org/10.3390/a13080197.
Повний текст джерелаBredereck, R., J. Chen, S. Hartung, S. Kratsch, R. Niedermeier, O. Suchy, and G. J. Woeginger. "A Multivariate Complexity Analysis of Lobbying in Multiple Referenda." Journal of Artificial Intelligence Research 50 (June 27, 2014): 409–46. http://dx.doi.org/10.1613/jair.4285.
Повний текст джерелаNguyen, Thanh H., Mason Wright, Michael P. Wellman, and Satinder Singh. "Multistage Attack Graph Security Games: Heuristic Strategies, with Empirical Game-Theoretic Analysis." Security and Communication Networks 2018 (December 13, 2018): 1–28. http://dx.doi.org/10.1155/2018/2864873.
Повний текст джерелаCarneiro, Alan Diêgo Aurélio, Fábio Protti, and Uéverton dos Santos Souza. "On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem." Theoretical Computer Science 909 (March 2022): 97–109. http://dx.doi.org/10.1016/j.tcs.2022.01.031.
Повний текст джерелаDONG, XIAO, and GUOYAN ZHENG. "MATCHING PARAMETERIZED SHAPES BY NONPARAMETRIC BELIEF PROPAGATION." International Journal of Pattern Recognition and Artificial Intelligence 23, no. 02 (March 2009): 209–46. http://dx.doi.org/10.1142/s0218001409007120.
Повний текст джерелаPourhassan, Mojgan, Feng Shi, and Frank Neumann. "Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem." Evolutionary Computation 27, no. 4 (December 2019): 559–75. http://dx.doi.org/10.1162/evco_a_00255.
Повний текст джерелаFaran, Rachel, and Orna Kupferman. "A Parametrized Analysis of Algorithms on Hierarchical Graphs." International Journal of Foundations of Computer Science 30, no. 06n07 (September 2019): 979–1003. http://dx.doi.org/10.1142/s0129054119400252.
Повний текст джерелаToms, Benjamin A., Jeffrey B. Basara, and Yang Hong. "Usage of Existing Meteorological Data Networks for Parameterized Road Ice Formation Modeling." Journal of Applied Meteorology and Climatology 56, no. 7 (July 2017): 1959–76. http://dx.doi.org/10.1175/jamc-d-16-0199.1.
Повний текст джерелаKowaluk, Mirosław, and Andrzej Lingas. "A Multi-Dimensional Matrix Product—A Natural Tool for Parameterized Graph Algorithms." Algorithms 15, no. 12 (November 28, 2022): 448. http://dx.doi.org/10.3390/a15120448.
Повний текст джерелаSato, T., and Y. Kameya. "Parameter Learning of Logic Programs for Symbolic-Statistical Modeling." Journal of Artificial Intelligence Research 15 (December 1, 2001): 391–454. http://dx.doi.org/10.1613/jair.912.
Повний текст джерелаXia, Lirong, and Weiqiang Zheng. "The Smoothed Complexity of Computing Kemeny and Slater Rankings." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 6 (May 18, 2021): 5742–50. http://dx.doi.org/10.1609/aaai.v35i6.16720.
Повний текст джерелаRostkier-Edelstein, Dorita, and Joshua P. Hacker. "The Roles of Surface-Observation Ensemble Assimilation and Model Complexity for Nowcasting of PBL Profiles: A Factor Separation Analysis." Weather and Forecasting 25, no. 6 (December 1, 2010): 1670–90. http://dx.doi.org/10.1175/2010waf2222435.1.
Повний текст джерелаSchlosser, Michail, Axel Schumacher, and Klaus Bellendir. "Effective Modeling of Load Applications in Composite Structures - Accuracy, Complexity, Computational Time." Key Engineering Materials 809 (June 2019): 461–66. http://dx.doi.org/10.4028/www.scientific.net/kem.809.461.
Повний текст джерелаGaspers, Serge, and Kamran Najeebullah. "Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 533–40. http://dx.doi.org/10.1609/aaai.v33i01.3301533.
Повний текст джерелаZhang, Rui, and Shihua Zhang. "Rethinking Influence Functions of Neural Networks in the Over-Parameterized Regime." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 8 (June 28, 2022): 9082–90. http://dx.doi.org/10.1609/aaai.v36i8.20893.
Повний текст джерелаBulteau, Laurent, Guillaume Fertin, Géraldine Jean, and Christian Komusiewicz. "Sorting by Multi-Cut Rearrangements." Algorithms 14, no. 6 (May 29, 2021): 169. http://dx.doi.org/10.3390/a14060169.
Повний текст джерелаChini, Peter, Roland Meyer, and Prakash Saivasan. "Fine-Grained Complexity of Safety Verification." Journal of Automated Reasoning 64, no. 7 (July 14, 2020): 1419–44. http://dx.doi.org/10.1007/s10817-020-09572-x.
Повний текст джерелаBannach, Max, and Sebastian Berndt. "Practical Access to Dynamic Programming on Tree Decompositions." Algorithms 12, no. 8 (August 16, 2019): 172. http://dx.doi.org/10.3390/a12080172.
Повний текст джерела