Добірка наукової літератури з теми "Relaxed problem variants"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Relaxed problem variants".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Relaxed problem variants"
Du, Yihong. "Critical point theorems with relaxed boundary condition and applications." Bulletin of the Australian Mathematical Society 47, no. 1 (February 1993): 101–18. http://dx.doi.org/10.1017/s0004972700012302.
Повний текст джерелаTran, Tony, Minh Do, Eleanor Rieffel, Jeremy Frank, Zhihui Wang, Bryan O'Gorman, Davide Venturelli, and J. Beck. "A Hybrid Quantum-Classical Approach to Solving Scheduling Problems." Proceedings of the International Symposium on Combinatorial Search 7, no. 1 (September 1, 2021): 98–106. http://dx.doi.org/10.1609/socs.v7i1.18390.
Повний текст джерелаGajjar, Kshitij, Agastya Vibhuti Jha, Manish Kumar, and Abhiruk Lahiri. "Reconfiguring Shortest Paths in Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 9 (June 28, 2022): 9758–66. http://dx.doi.org/10.1609/aaai.v36i9.21211.
Повний текст джерелаYaffe, Tamir, Shawn Skyler, and Ariel Felner. "Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search." Proceedings of the International Symposium on Combinatorial Search 12, no. 1 (July 21, 2021): 106–14. http://dx.doi.org/10.1609/socs.v12i1.18557.
Повний текст джерелаSingamsetty, Purusotham, and Jayanth Kumar Thenepalle. "An efficient genetic algorithm for solving open multiple travelling salesman problem with load balancing constraint." Decision Science Letters 10, no. 4 (2021): 525–34. http://dx.doi.org/10.5267/j.dsl.2021.5.003.
Повний текст джерелаWalker, Thayne T., Nathan R. Sturtevant, and Ariel Felner. "Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 05 (April 3, 2020): 7277–84. http://dx.doi.org/10.1609/aaai.v34i05.6219.
Повний текст джерелаIvankovic, Franc, Patrik Haslum, Sylvie Thiebaux, Vikas Shivashankar, and Dana Nau. "Optimal Planning with Global Numerical State Constraints." Proceedings of the International Conference on Automated Planning and Scheduling 24 (May 10, 2014): 145–53. http://dx.doi.org/10.1609/icaps.v24i1.13648.
Повний текст джерелаWang, Lingya, and Dean S. Oliver. "Efficient Optimization of Well-Drilling Sequence with Learned Heuristics." SPE Journal 24, no. 05 (August 26, 2019): 2111–34. http://dx.doi.org/10.2118/195640-pa.
Повний текст джерелаMendoza, Victoria May P., Renier Mendoza, Jongmin Lee, and Eunok Jung. "Adjusting non-pharmaceutical interventions based on hospital bed capacity using a multi-operator differential evolution." AIMS Mathematics 7, no. 11 (2022): 19922–53. http://dx.doi.org/10.3934/math.20221091.
Повний текст джерелаPagel, Kymberleigh A., Rick Kim, Kyle Moad, Ben Busby, Lily Zheng, Collin Tokheim, Michael Ryan, and Rachel Karchin. "Integrated Informatics Analysis of Cancer-Related Variants." JCO Clinical Cancer Informatics, no. 4 (September 2020): 310–17. http://dx.doi.org/10.1200/cci.19.00132.
Повний текст джерелаДисертації з теми "Relaxed problem variants"
Lin, Shian-liang, and 林憲良. "A Survey on the Algorithms of the Edit Distance Problem and Related Variants." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/xwc588.
Повний текст джерела國立中山大學
資訊工程學系研究所
105
Abstract The edit distance problem has been studied for several decades. Given sequences (strings) A and B with length m and n, respectively, m ≤ n, the edit distance problem is to find the minimum cost of operations required to transform A to B. According to different models of cost functions, operations and input sequences, the problem has several variants. The edit distance on run-length encoding sequences and cyclic sequences are the variants on the input aspect. The block edit problem is a variant on the operation aspect. The edit distance considering consecutive insertions and deletions is another variant on the cost function. Besides, the genome rearrangement problem can also be viewed as a variant, whose operations include inversions, reversals and transpositions. In this thesis, we survey some algorithms for the edit distance problem, its variants and the genome rearrangement problem. We also perform some experiments to illustrate the execution efficiency of various algorithms. Keywords: Edit Distance, Block Edit, Genome Rearrangement, Longest Common Subsequence, Dynamic Programing, Similarity
Книги з теми "Relaxed problem variants"
Kuz'mina, Tat'yana. Self-awareness and personal adaptive potential in normal and impaired development. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1086621.
Повний текст джерелаPye, David. Practical Nitriding and Ferritic Nitrocarburizing. ASM International, 2003. http://dx.doi.org/10.31399/asm.tb.pnfn.9781627083508.
Повний текст джерелаTaljanovic, Mihra S., Imran M. Omar, Kevin B. Hoover, and Tyson S. Chadaz, eds. Musculoskeletal Imaging Volume 1. Oxford University Press, 2019. http://dx.doi.org/10.1093/med/9780190938161.001.0001.
Повний текст джерелаTaljanovic, Mihra S., Imran M. Omar, Kevin B. Hoover, and Tyson S. Chadaz, eds. Musculoskeletal Imaging Volume 2. Oxford University Press, 2019. http://dx.doi.org/10.1093/med/9780190938178.001.0001.
Повний текст джерелаRose, Cramer Sacha. Vaccine Nationalism in the age of COVID-19. Technische Universität Dresden, 2021. http://dx.doi.org/10.25368/2022.413.
Повний текст джерелаCasey, Patricia. History of the concept of adjustment disorders (DRAFT). Oxford University Press, 2018. http://dx.doi.org/10.1093/med/9780198786214.003.0001.
Повний текст джерелаCrowley, Lara M. Manuscript Matters. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198821861.001.0001.
Повний текст джерелаSuprun, Sergey P., Anatoly P. Suprun, and Victor F. Petrenko. Schrödinger's Cat Smile. BENTHAM SCIENCE PUBLISHERS, 2022. http://dx.doi.org/10.2174/97898150496641220201.
Повний текст джерелаЧастини книг з теми "Relaxed problem variants"
Frazho, A. E., S. ter Horst, and M. A. Kaashoek. "A Time-variant Norm Constrained Interpolation Problem Arising from Relaxed Commutant Lifting." In Operator Algebras, Operator Theory and Applications, 139–66. Basel: Birkhäuser Basel, 2009. http://dx.doi.org/10.1007/978-3-0346-0174-0_6.
Повний текст джерелаBen-Haim, Yakov. "Nonlinear Problems in Selectively Sensitive Identification of Structures." In Safety Evaluation Based on Identification Approaches Related to Time-Variant and Nonlinear Structures, 204–21. Wiesbaden: Vieweg+Teubner Verlag, 1993. http://dx.doi.org/10.1007/978-3-322-89467-0_12.
Повний текст джерелаDumas, Éric, David Lannes, and Jérémie Szeftel. "Variants of the Focusing NLS Equation: Derivation, Justification, and Open Problems Related to Filamentation." In Laser Filamentation, 19–75. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-23084-9_2.
Повний текст джерелаFingerhut, Abe, Hayato Kurihara, and William Tzu-Liang Chen. "Vascular Problems Related to Colectomy: Habitual and Variant Anatomy, Prevention, and Tactical Aspects." In Prophylactic Surgery, 193–200. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-66853-2_18.
Повний текст джерелаTran, Hoang-Dung, Neelanjana Pal, Patrick Musau, Diego Manzanas Lopez, Nathaniel Hamilton, Xiaodong Yang, Stanley Bak, and Taylor T. Johnson. "Robustness Verification of Semantic Segmentation Neural Networks Using Relaxed Reachability." In Computer Aided Verification, 263–86. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_12.
Повний текст джерелаHogben, Leslie. "Nordhaus-Gaddum problems for Colin de Verdière type parameters, variants of tree-width, and related parameters." In Recent Trends in Combinatorics, 275–94. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-24298-9_12.
Повний текст джерелаPerrot, Nancy, Amal Benhamiche, Yannick Carlinet, and Eric Gourdin. "Future Networks." In Research Anthology on Developing and Optimizing 5G Networks and the Impact on Society, 677–706. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-7708-0.ch028.
Повний текст джерелаMokrzycka, Krystyna. "Tożsamość konstytucyjna – monolit czy krajobraz inności?" In Interdyscyplinarny wymiar tożsamości konstytucyjnej, 13–30. Ksiegarnia Akademicka Publishing, 2022. http://dx.doi.org/10.12797/9788381387149.01.
Повний текст джерела"Two-Echelon Location-Routing and Vehicle Routing Problems in City Logistics." In Logistics and Transport Modeling in Urban Goods Movement, 55–87. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-8292-2.ch003.
Повний текст джерелаReyes, Laura Cruz, Claudia Gómez Santillán, Marcela Quiroz, Adriana Alvim, Patricia Melin, Jorge Ruiz Vanoye, and Vanesa Landero Najera. "Heuristic Algorithms." In Logistics Management and Optimization through Hybrid Artificial Intelligence Systems, 238–67. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0297-7.ch009.
Повний текст джерелаТези доповідей конференцій з теми "Relaxed problem variants"
Wang, Rong, Jitao Lu, Yihang Lu, Feiping Nie, and Xuelong Li. "Discrete Multiple Kernel k-means." 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/428.
Повний текст джерелаKhajavirad, Aida, and Jeremy J. Michalek. "A Single-Stage Gradient-Based Approach for Solving the Joint Product Family Platform Selection and Design Problem Using Decomposition." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-35611.
Повний текст джерелаKhajavirad, Aida, and Jeremy J. Michalek. "An Extension of the Commonality Index for Product Family Optimization." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-35605.
Повний текст джерелаBiłozor, Andrzej, and Małgorzata Renigier-Biłozor. "Methodology of the Polyoptimization for Spatial Processes." In Environmental Engineering. VGTU Technika, 2017. http://dx.doi.org/10.3846/enviro.2017.100.
Повний текст джерелаFarhadi, Alireza, and MohammadTaghi Hajiaghayi. "On the Complexity of Chore Division." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/31.
Повний текст джерелаGlotzer, Dylan, and Vladas Pipiras. "Statistical Perspectives on Some Problems Arising in Naval Engineering." In SNAME 30th American Towing Tank Conference. SNAME, 2017. http://dx.doi.org/10.5957/attc-2017-0047.
Повний текст джерелаNakagawa, Kei, Shuhei Noma та Masaya Abe. "RM-CVaR: Regularized Multiple β-CVaR Portfolio". У 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/629.
Повний текст джерелаSevostyanov, Petr A., Tatyana A. Samoilova, and Maria L. Markova. "The method of adaptive random search for training the neural network." In INTERNATIONAL SCIENTIFIC-TECHNICAL SYMPOSIUM (ISTS) «IMPROVING ENERGY AND RESOURCE-EFFICIENT AND ENVIRONMENTAL SAFETY OF PROCESSES AND DEVICES IN CHEMICAL AND RELATED INDUSTRIES». The Kosygin State University of Russia, 2021. http://dx.doi.org/10.37816/eeste-2021-2-78-82.
Повний текст джерела"Dravet syndrome and Dravet-like phenotype: a systematic review of the SCN1A and PCDH19 variants." In XIII Congresso Paulista de Neurologia. Zeppelini Editorial e Comunicação, 2021. http://dx.doi.org/10.5327/1516-3180.229.
Повний текст джерелаGobbi, Massimiliano. "Optimal and Robust Design of Ground Vehicle Systems." In ASME 8th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2006. http://dx.doi.org/10.1115/esda2006-95471.
Повний текст джерелаЗвіти організацій з теми "Relaxed problem variants"
Woodson, William, Shimon Mayak, and Haim Rabinowitch. Physiological and Molecular Characterization of the Response to Ethylene during Senescence of Carnation Genotypic Variants. United States Department of Agriculture, July 1995. http://dx.doi.org/10.32747/1995.7613011.bard.
Повний текст джерела