Auswahl der wissenschaftlichen Literatur zum Thema „General k-max search“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "General k-max search" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "General k-max search"
Xian, Aiyong, Kaiyuan Zhu, Daming Zhu, Lianrong Pu und Hong Liu. „Approximating Max NAE-k-SAT by anonymous local search“. Theoretical Computer Science 657 (Januar 2017): 54–63. http://dx.doi.org/10.1016/j.tcs.2016.05.040.
Der volle Inhalt der QuelleAhr, Dino, und Gerhard Reinelt. „A tabu search algorithm for the min–max k-Chinese postman problem“. Computers & Operations Research 33, Nr. 12 (Dezember 2006): 3403–22. http://dx.doi.org/10.1016/j.cor.2005.02.011.
Der volle Inhalt der QuelleCiftci, Esra, Emel Sesli Cetin, Ebru Us, Hüseyin Haydar Kutlu und 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.
Der volle Inhalt der QuelleLan, Tianming, und 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.
Der volle Inhalt der QuelleGupta, Ankita, Lakhwinder Kaur und 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.
Der volle Inhalt der QuelleHamann, Arne, und Sabine Wölk. „Performance analysis of a hybrid agent for quantum-accessible reinforcement learning“. New Journal of Physics 24, Nr. 3 (01.03.2022): 033044. http://dx.doi.org/10.1088/1367-2630/ac5b56.
Der volle Inhalt der QuelleWang, Yanhao, Francesco Fabbri, Michael Mathioudakis und 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.
Der volle Inhalt der QuelleJayanthi, Neelampalli, Burra Babu und 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.
Der volle Inhalt der QuelleGaspers, Serge, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh und 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.
Der volle Inhalt der QuellePechnikov, Gennady, Alexander Blinkov und 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.
Der volle Inhalt der QuelleDissertationen zum Thema "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.
Der volle Inhalt der QuelleThis 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
Buchteile zum Thema "General k-max search"
Lopez, Kyra Mikaela M., und 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“. In Machine Learning and Artificial Intelligence. IOS Press, 2020. http://dx.doi.org/10.3233/faia200765.
Der volle Inhalt der QuelleJabari, Farkhondeh, Heresh Seyedia, Sajad Najafi Ravadanegh und Behnam Mohammadi Ivatloo. „Stochastic Contingency Analysis Based on Voltage Stability Assessment in Islanded Power System Considering Load Uncertainty Using MCS and k-PEM“. In Advances in Computer and Electrical Engineering, 12–36. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-9911-3.ch002.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "General k-max search"
Tönshoff, Jan, Berke Kisin, Jakob Lindner und Martin Grohe. „One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction“. In 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.
Der volle Inhalt der QuelleNeagu, Laurentiumarian, Teodormihai Cotet, Mihai Dascalu, Stefan Trausanmatu, Laura Badescu und Eugen Simion. „SEMANTIC AUTHOR RECOMMENDATIONS BASED ON THEIR BIOGRAPHY FROM THE GENERAL ROMANIAN DICTIONARY OF LITERATURE“. In eLSE 2019. Carol I National Defence University Publishing House, 2019. http://dx.doi.org/10.12753/2066-026x-19-022.
Der volle Inhalt der QuelleSeena, Abu. „Determinant Search Method for the Large Structural Systems With Small Bandwidth“. In ASME 2021 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/imece2021-71761.
Der volle Inhalt der QuelleHu, Zijian, Fengjun Bai, Huajie Wang, Chuanhui Sun, Pinwei Li, Haoyan Li, Yunlong Fu, Jie Zhang und Yin Luo. „Deep Learning Approaches in Tight Gas Field Pay Zone Classification“. In SPE Argentina Exploration and Production of Unconventional Resources Symposium. SPE, 2023. http://dx.doi.org/10.2118/212394-ms.
Der volle Inhalt der QuelleAhmadov, Jamal. „Utilizing Data-Driven Models to Predict Brittleness in Tuscaloosa Marine Shale: A Machine Learning Approach“. In SPE Annual Technical Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/208628-stu.
Der volle Inhalt der QuelleBarreto Fernandes, Francisco António, und Bernabé Hernandis Ortuño. „Usability and User-Centered Design - User Evaluation Experience in Self-Checkout Technologies“. In Systems & Design 2017. Valencia: Universitat Politècnica València, 2017. http://dx.doi.org/10.4995/sd2017.2017.6634.
Der volle Inhalt der QuelleAndov, Stojan, Violeta Cvetkoska und Tea Mijac. „Unveiling Global Road Accident Patterns - Insights, Analytics, and Implications for Safer Driving Practices“. In 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.
Der volle Inhalt der Quelle