Добірка наукової літератури з теми "Parameterised complexity analysis"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Parameterised complexity analysis".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Parameterised complexity analysis"
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.
Повний текст джерелаДисертації з теми "Parameterised complexity analysis"
Wareham, Harold Todd. "Systematic parameterized complexity analysis in computational phonology." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ37368.pdf.
Повний текст джерелаBergé, Pierre. "Algorithmes pour voyager sur un graphe contenant des blocages." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS480.
Повний текст джерелаWe study NP-hard problems on graphs with blockages seen as models of networks which are exposed to risk of failures.We treat cut problems via the parameterized complexity framework. The cutset size p is taken as a parameter. Given a set of sources {s1,...,sk} and a target $t, we propose an algorithm which builds a small edge cut of size p separating at least r sources from t. This NP-complete problem is called Partial One-Target Cut. It belongs to the family of multiterminal cut problems. Our algorithm is fixed-parameter tractable (FPT) as its execution takes $2^{O(p^2)}n^{O(1)}$. We prove that the vertex version of this problem, which imposes cuts to contain vertices instead of edges, is W[1]-hard. Then, we design an FPT algorithm which counts the minimum vertex (S,T)-cuts of an undirected graph in time $2^{O(plog p)}n^{O(1)}$.We provide numerous results on the competitive ratio of both deterministic and randomized strategies for the Canadian Traveller Problem. The optimal ratio obtained for the deterministic strategies on general graphs is 2k+1, where k is a given upper bound on the number of blockages. We show that randomized strategies which do not use memory cannot improve the bound 2k+1. In addition, we discuss the tightness of lower bounds on the competitiveness of randomized strategies. The distance competitive ratio for a group of travellers possibly equipped with telecommunication devices is studied. Eventually, a strategy dedicated to equal-weight chordal graphs is proposed while another one is built for graphs with small maximum (s,t)-cuts. Both strategies outperform the ratio 2k+1
Molter, Hendrik [Verfasser], Rolf [Akademischer Betreuer] Niedermeier, Rolf [Gutachter] Niedermeier, Thomas [Gutachter] Erlebach, and Ralf [Gutachter] Klasing. "Classic graph problems made temporal – a parameterized complexity analysis / Hendrik Molter ; Gutachter: Rolf Niedermeier, Thomas Erlebach, Ralf Klasing ; Betreuer: Rolf Niedermeier." Berlin : Universitätsverlag der TU Berlin, 2020. http://d-nb.info/1223023125/34.
Повний текст джерелаChinot, Geoffrey. "Localization methods with applications to robust learning and interpolation." Electronic Thesis or Diss., Institut polytechnique de Paris, 2020. http://www.theses.fr/2020IPPAG002.
Повний текст джерелаThis PhD thesis deals with supervized machine learning and statistics. The main goal is to use localization techniques to derive fast rates of convergence, with a particular focus on robust learning and interpolation problems.Localization methods aim to analyze localized properties of an estimator to obtain fast rates of convergence, that is rates of order O(1/n), where n is the number of observations. Under assumptions, such as the Bernstein condition, such rates are attainable.A robust estimator is an estimator with good theoretical guarantees, under as few assumptions as possible. This question is getting more and more popular in the current era of big data. Large dataset are very likely to be corrupted and one would like to build reliable estimators in such a setting. We show that the well-known regularized empirical risk minimizer (RERM) with Lipschitz-loss function is robust with respect to heavy-tailed noise and outliers in the label. When the class of predictor is heavy-tailed, RERM is not reliable. In this setting, we show that minmax Median of Means estimators can be a solution. By construction minmax-MOM estimators are also robust to an adversarial contamination.Interpolation problems study learning procedure with zero training error. Surprisingly, in large dimension, interpolating the data does not necessarily implies over-fitting. We study a high dimensional Gaussian linear model and show that sometimes the over-fitting may be benign
Pourhassan, Mojgan. "Parameterised complexity analysis of evolutionary algorithms for combinatorial optimization problems." Thesis, 2017. http://hdl.handle.net/2440/109799.
Повний текст джерелаThesis (Ph.D.) -- University of Adelaide, School of Computer Science, 2017.
Wareham, Harold. "Systematic parameterized complexity analysis in computational phonology." Thesis, 1999. https://dspace.library.uvic.ca//handle/1828/8806.
Повний текст джерелаGraduate
Книги з теми "Parameterised complexity analysis"
J, Woeginger Gerhard, and SpringerLink (Online service), eds. Parameterized and Exact Computation: 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Знайти повний текст джерелаPeter, Rossmanith, and SpringerLink (Online service), eds. Parameterized and Exact Computation: 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.
Знайти повний текст джерелаRooij, Iris van, Mark Blokpoel, Johan Kwisthout, and Todd Wareham. Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis. Cambridge University Press, 2019.
Знайти повний текст джерелаRooij, Iris van, Mark Blokpoel, Johan Kwisthout, and Todd Wareham. Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis. Cambridge University Press, 2019.
Знайти повний текст джерелаRooij, Iris van, Mark Blokpoel, Johan Kwisthout, and Todd Wareham. Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis. Cambridge University Press, 2019.
Знайти повний текст джерелаRooij, Iris van, Mark Blokpoel, Johan Kwisthout, and Todd Wareham. Cognition and Intractability: A Guide to Classical and Parameterized Complexity Analysis. Cambridge University Press, 2019.
Знайти повний текст джерелаMarx, Daniel, and Peter Rossmanith. Parameterized and Exact Computation: 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers. Springer, 2012.
Знайти повний текст джерелаЧастини книг з теми "Parameterised complexity analysis"
Dorn, Britta, and Ildikó Schlotter. "Multivariate Complexity Analysis of Swap Bribery." In Parameterized and Exact Computation, 107–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17493-3_12.
Повний текст джерелаNeumann, Frank, and Andrew M. Sutton. "Parameterized Complexity Analysis of Randomized Search Heuristics." In Natural Computing Series, 213–48. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-29414-4_4.
Повний текст джерелаBonnet, Édouard, Bruno Escoffier, Vangelis Th Paschos, and Émeric Tourniaire. "Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization." In Parameterized and Exact Computation, 66–77. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03898-8_7.
Повний текст джерелаFroese, Vincent, René van Bevern, Rolf Niedermeier, and Manuel Sorge. "A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems." In Mathematical Foundations of Computer Science 2013, 445–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40313-2_40.
Повний текст джерелаJaffke, Lars, and Bart M. P. Jansen. "Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems." In Lecture Notes in Computer Science, 345–56. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-57586-5_29.
Повний текст джерелаBalasubramanian, A. R., Lucie Guillou, and Chana Weil-Kennedy. "Parameterized Analysis of Reconfigurable Broadcast Networks." In Lecture Notes in Computer Science, 61–80. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99253-8_4.
Повний текст джерелаHermelin, Danny, and Liat Rozenberg. "Parameterized Complexity Analysis for the Closest String with Wildcards Problem." In Combinatorial Pattern Matching, 140–49. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07566-2_15.
Повний текст джерелаKawamura, Akitoshi, Florian Steinberg, and Holger Thies. "Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving." In Logic, Language, Information, and Computation, 223–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-57669-4_13.
Повний текст джерелаCarneiro, Alan Diêgo Aurélio, Fábio Protti, and Uéverton S. Souza. "Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion – A Deadlock Resolution Graph Problem." In Lecture Notes in Computer Science, 84–95. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94776-1_8.
Повний текст джерелаSingh, Niraj Kumar, and Soubhik Chakraborty. "Partition Sort versus Quick Sort: A Comparative Average Case Analysis with Special Emphasis on Parameterized Complexity." In Advances in Computing and Information Technology, 107–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-31552-7_12.
Повний текст джерелаТези доповідей конференцій з теми "Parameterised complexity analysis"
Neumann, Frank, and Andrew M. Sutton. "Parameterized Complexity Analysis of Evolutionary Algorithms." In GECCO '15: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2739482.2756562.
Повний текст джерелаNeumann, Frank, and Andrew M. Sutton. "Parameterized complexity analysis of evolutionary algorithms." In GECCO '14: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2598394.2605351.
Повний текст джерелаGrüttemeier, Niels, and Christian Komusiewicz. "Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/586.
Повний текст джерелаSilva, Janio Carlos Nascimento, Uéverton dos Santos Souza, and Luiz Satoru Ochi. "Algorithmic Aspects of Problems Related to Optimization, Circuits, and Parameterized Complexity." In Concurso de Teses e Dissertações. Sociedade Brasileira de Computação - SBC, 2022. http://dx.doi.org/10.5753/ctd.2022.223305.
Повний текст джерелаSouza, Uéverton, Fábio Protti, Maise Da Silva, and Dieter Rautenbach. "Multivariate Investigation of NP-Hard Problems: Boundaries Between Parameterized Tractability and Intractability." In XXVIII Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/ctd.2015.9996.
Повний текст джерелаDu, Zhe, Zexiang Liu, Jack Weitze, and Necmiye Ozay. "Sample Complexity Analysis and Self-regularization in Identification of Over-parameterized ARX Models." In 2022 IEEE 61st Conference on Decision and Control (CDC). IEEE, 2022. http://dx.doi.org/10.1109/cdc51059.2022.9993310.
Повний текст джерелаBoehmer, Niclas, Robert Bredereck, Piotr Faliszewski, and Rolf Niedermeier. "Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/8.
Повний текст джерелаFroese, Vincent, Pascal Kunz, and Philipp Zschoche. "Disentangling the Computational Complexity of Network Untangling." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/283.
Повний текст джерелаNallaperuma, Samadhi, Andrew M. Sutton, and Frank Neumann. "Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem." In 2013 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2013. http://dx.doi.org/10.1109/cec.2013.6557810.
Повний текст джерелаJia, M., R. P. Jia, and J. J. Yu. "Conceptual Design of 2-DOF Flexure-Based Sensing Mechanisms for Superconductor Gravity Gradient." In ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-46827.
Повний текст джерела