Gotowa bibliografia na temat „General k-max search”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „General k-max search”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "General k-max search"
Xian, Aiyong, Kaiyuan Zhu, Daming Zhu, Lianrong Pu i Hong Liu. "Approximating Max NAE-k-SAT by anonymous local search". Theoretical Computer Science 657 (styczeń 2017): 54–63. http://dx.doi.org/10.1016/j.tcs.2016.05.040.
Pełny tekst źródłaAhr, Dino, i Gerhard Reinelt. "A tabu search algorithm for the min–max k-Chinese postman problem". Computers & Operations Research 33, nr 12 (grudzień 2006): 3403–22. http://dx.doi.org/10.1016/j.cor.2005.02.011.
Pełny tekst źródłaCiftci, Esra, Emel Sesli Cetin, Ebru Us, Hüseyin Haydar Kutlu i Buket Cicioglu Arıdogan. "Investigation of Carbapenem resistance mechanisms in Klebsiella pneumoniae by using phenotypic tests and a molecular assay". Journal of Infection in Developing Countries 13, nr 11 (30.11.2019): 992–1000. http://dx.doi.org/10.3855/jidc.10783.
Pełny tekst źródłaLan, Tianming, i Lei Guo. "Discovery of User Groups Densely Connecting Virtual and Physical Worlds in Event-Based Social Networks". International Journal of Information Technologies and Systems Approach 16, nr 2 (28.07.2023): 1–23. http://dx.doi.org/10.4018/ijitsa.327004.
Pełny tekst źródłaGupta, Ankita, Lakhwinder Kaur i Gurmeet Kaur. "Drought stress detection technique for wheat crop using machine learning". PeerJ Computer Science 9 (19.05.2023): e1268. http://dx.doi.org/10.7717/peerj-cs.1268.
Pełny tekst źródłaHamann, Arne, i Sabine Wölk. "Performance analysis of a hybrid agent for quantum-accessible reinforcement learning". New Journal of Physics 24, nr 3 (1.03.2022): 033044. http://dx.doi.org/10.1088/1367-2630/ac5b56.
Pełny tekst źródłaWang, Yanhao, Francesco Fabbri, Michael Mathioudakis i Jia Li. "Fair Max–Min Diversity Maximization in Streaming and Sliding-Window Models". Entropy 25, nr 7 (14.07.2023): 1066. http://dx.doi.org/10.3390/e25071066.
Pełny tekst źródłaJayanthi, Neelampalli, Burra Babu i Nandam Rao. "Outlier Detection Method based on Adaptive Clustering Method and Density Peak". International Journal of Intelligent Engineering and Systems 13, nr 6 (31.12.2020): 120–30. http://dx.doi.org/10.22266/ijies2020.1231.11.
Pełny tekst źródłaGaspers, Serge, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh i Stefan Szeider. "Don't Be Strict in Local Search!" Proceedings of the AAAI Conference on Artificial Intelligence 26, nr 1 (20.09.2021): 486–92. http://dx.doi.org/10.1609/aaai.v26i1.8128.
Pełny tekst źródłaPechnikov, Gennady, Alexander Blinkov i Elena Parshina. "K. Marx on his own form and content in legal relations". Legal Science and Practice: Journal of Nizhny Novgorod Academy of the Ministry of Internal Affairs of Russia 2022, nr 4 (27.12.2022): 66–70. http://dx.doi.org/10.36511/2078-5356-2022-4-66-70.
Pełny tekst źródłaRozprawy doktorskie na temat "General k-max search"
Schroeder, Pascal. "Performance guaranteeing algorithms for solving online decision problems in financial systems". Electronic Thesis or Diss., Université de Lorraine, 2019. http://www.theses.fr/2019LORR0143.
Pełny tekst źródłaThis thesis contains several online financial decision problems and their solutions. The problems are formulated as online problems (OP) and online algorithms (OA) are created to solve them. Due to the fact that there can be various OA for the same OP, there must be some criteria with which one can make statements about the quality of an OA. In this thesis these criteria are the competitive ratio (c), the competitive difference (cd) and the numerical performance. An OA with a lower c is preferable to another one with a higher value. An OA that has the lowest c is called optimal. We consider the following OPS. The online conversion problem (OCP), the online portfolio selection problem (PSP) and the cash management problem (CMP). After the introductory chapter, the OPs, the notation and the state of the art in the field of OPs is presented. In the third chapter, three variants of the OCP with interrelated prices are solved. In the fourth chapter the time series search with interrelated prices is revisited and new algorithms are created. At the end of the chapter, the optimal OA k-DIV for the general k-max search with interrelated prices is developed. In Chapter 5 the PSP with interrelated prices is solved. The created OA OPIP is optimal. Using the idea of OPIP, an optimal OA for the two-way trading is created (OCIP). Having OCIP, an optimal OA for the bi-directional search knowing the values of θ_1 and θ_2 is created (BUND). For unknown θ_1 and θ_2, the optimal OA RUNis created. The chapter ends with an empirical (for OPIP) and experimental (for OCIP, BUND and RUN) testing. Chapters 6 and 7 deal with the CMP. In both of them, a numerical testing is done in order to compare the numerical performance of the new OAs to the one of the already established ones. In Chapter 6 an optimal OA is constructed; in Chapter 7, OAs are designed which minimize cd. The OA BCSID solves the CMP with interrelated demands to optimality. The OA aBBCSID solves the CMP when the values of de θ_1, θ_2,m and M are known; however, this OA is not optimal. In Chapter 7 the CMP is solved, knowing m and M and minimizing cd (OA MRBD). For the interrelated demands, a heuristic OA (HMRID) and a cd-minimizing OA (MRID) is presented. HMRID is good compromise between the numerical performance and the minimization of cd. The thesis concludes with a short discussion about shortcomings of the considered OPs and the created OAs. Then some remarks about future research possibilities in this field are given
Części książek na temat "General k-max search"
Lopez, Kyra Mikaela M., i Ma Sheila A. Magboo. "A Clinical Decision Support Tool to Detect Invasive Ductal Carcinoma in Histopathological Images Using Support Vector Machines, Naïve-Bayes, and K-Nearest Neighbor Classifiers". W Machine Learning and Artificial Intelligence. IOS Press, 2020. http://dx.doi.org/10.3233/faia200765.
Pełny tekst źródłaJabari, Farkhondeh, Heresh Seyedia, Sajad Najafi Ravadanegh i Behnam Mohammadi Ivatloo. "Stochastic Contingency Analysis Based on Voltage Stability Assessment in Islanded Power System Considering Load Uncertainty Using MCS and k-PEM". W Advances in Computer and Electrical Engineering, 12–36. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-9911-3.ch002.
Pełny tekst źródłaStreszczenia konferencji na temat "General k-max search"
Tönshoff, Jan, Berke Kisin, Jakob Lindner i Martin Grohe. "One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction". W Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/476.
Pełny tekst źródłaNeagu, Laurentiumarian, Teodormihai Cotet, Mihai Dascalu, Stefan Trausanmatu, Laura Badescu i Eugen Simion. "SEMANTIC AUTHOR RECOMMENDATIONS BASED ON THEIR BIOGRAPHY FROM THE GENERAL ROMANIAN DICTIONARY OF LITERATURE". W eLSE 2019. Carol I National Defence University Publishing House, 2019. http://dx.doi.org/10.12753/2066-026x-19-022.
Pełny tekst źródłaSeena, Abu. "Determinant Search Method for the Large Structural Systems With Small Bandwidth". W ASME 2021 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/imece2021-71761.
Pełny tekst źródłaHu, Zijian, Fengjun Bai, Huajie Wang, Chuanhui Sun, Pinwei Li, Haoyan Li, Yunlong Fu, Jie Zhang i Yin Luo. "Deep Learning Approaches in Tight Gas Field Pay Zone Classification". W SPE Argentina Exploration and Production of Unconventional Resources Symposium. SPE, 2023. http://dx.doi.org/10.2118/212394-ms.
Pełny tekst źródłaAhmadov, Jamal. "Utilizing Data-Driven Models to Predict Brittleness in Tuscaloosa Marine Shale: A Machine Learning Approach". W SPE Annual Technical Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/208628-stu.
Pełny tekst źródłaBarreto Fernandes, Francisco António, i Bernabé Hernandis Ortuño. "Usability and User-Centered Design - User Evaluation Experience in Self-Checkout Technologies". W Systems & Design 2017. Valencia: Universitat Politècnica València, 2017. http://dx.doi.org/10.4995/sd2017.2017.6634.
Pełny tekst źródłaAndov, Stojan, Violeta Cvetkoska i Tea Mijac. "Unveiling Global Road Accident Patterns - Insights, Analytics, and Implications for Safer Driving Practices". W Economic and Business Trends Shaping the Future. Ss Cyril and Methodius University, Faculty of Economics-Skopje, 2023. http://dx.doi.org/10.47063/ebtsf.2023.0031.
Pełny tekst źródła