Littérature scientifique sur le sujet « General k-max search »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « General k-max search ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "General k-max search"
Xian, Aiyong, Kaiyuan Zhu, Daming Zhu, Lianrong Pu et Hong Liu. « Approximating Max NAE-k-SAT by anonymous local search ». Theoretical Computer Science 657 (janvier 2017) : 54–63. http://dx.doi.org/10.1016/j.tcs.2016.05.040.
Texte intégralAhr, Dino, et Gerhard Reinelt. « A tabu search algorithm for the min–max k-Chinese postman problem ». Computers & ; Operations Research 33, no 12 (décembre 2006) : 3403–22. http://dx.doi.org/10.1016/j.cor.2005.02.011.
Texte intégralCiftci, Esra, Emel Sesli Cetin, Ebru Us, Hüseyin Haydar Kutlu et 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, no 11 (30 novembre 2019) : 992–1000. http://dx.doi.org/10.3855/jidc.10783.
Texte intégralLan, Tianming, et 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, no 2 (28 juillet 2023) : 1–23. http://dx.doi.org/10.4018/ijitsa.327004.
Texte intégralGupta, Ankita, Lakhwinder Kaur et Gurmeet Kaur. « Drought stress detection technique for wheat crop using machine learning ». PeerJ Computer Science 9 (19 mai 2023) : e1268. http://dx.doi.org/10.7717/peerj-cs.1268.
Texte intégralHamann, Arne, et Sabine Wölk. « Performance analysis of a hybrid agent for quantum-accessible reinforcement learning ». New Journal of Physics 24, no 3 (1 mars 2022) : 033044. http://dx.doi.org/10.1088/1367-2630/ac5b56.
Texte intégralWang, Yanhao, Francesco Fabbri, Michael Mathioudakis et Jia Li. « Fair Max–Min Diversity Maximization in Streaming and Sliding-Window Models ». Entropy 25, no 7 (14 juillet 2023) : 1066. http://dx.doi.org/10.3390/e25071066.
Texte intégralJayanthi, Neelampalli, Burra Babu et Nandam Rao. « Outlier Detection Method based on Adaptive Clustering Method and Density Peak ». International Journal of Intelligent Engineering and Systems 13, no 6 (31 décembre 2020) : 120–30. http://dx.doi.org/10.22266/ijies2020.1231.11.
Texte intégralGaspers, Serge, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh et Stefan Szeider. « Don't Be Strict in Local Search ! » Proceedings of the AAAI Conference on Artificial Intelligence 26, no 1 (20 septembre 2021) : 486–92. http://dx.doi.org/10.1609/aaai.v26i1.8128.
Texte intégralPechnikov, Gennady, Alexander Blinkov et 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, no 4 (27 décembre 2022) : 66–70. http://dx.doi.org/10.36511/2078-5356-2022-4-66-70.
Texte intégralThèses sur le sujet "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.
Texte intégralThis 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
Chapitres de livres sur le sujet "General k-max search"
Lopez, Kyra Mikaela M., et 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 ». Dans Machine Learning and Artificial Intelligence. IOS Press, 2020. http://dx.doi.org/10.3233/faia200765.
Texte intégralJabari, Farkhondeh, Heresh Seyedia, Sajad Najafi Ravadanegh et Behnam Mohammadi Ivatloo. « Stochastic Contingency Analysis Based on Voltage Stability Assessment in Islanded Power System Considering Load Uncertainty Using MCS and k-PEM ». Dans Advances in Computer and Electrical Engineering, 12–36. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-9911-3.ch002.
Texte intégralActes de conférences sur le sujet "General k-max search"
Tönshoff, Jan, Berke Kisin, Jakob Lindner et Martin Grohe. « One Model, Any CSP : Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction ». Dans 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.
Texte intégralNeagu, Laurentiumarian, Teodormihai Cotet, Mihai Dascalu, Stefan Trausanmatu, Laura Badescu et Eugen Simion. « SEMANTIC AUTHOR RECOMMENDATIONS BASED ON THEIR BIOGRAPHY FROM THE GENERAL ROMANIAN DICTIONARY OF LITERATURE ». Dans eLSE 2019. Carol I National Defence University Publishing House, 2019. http://dx.doi.org/10.12753/2066-026x-19-022.
Texte intégralSeena, Abu. « Determinant Search Method for the Large Structural Systems With Small Bandwidth ». Dans ASME 2021 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/imece2021-71761.
Texte intégralHu, Zijian, Fengjun Bai, Huajie Wang, Chuanhui Sun, Pinwei Li, Haoyan Li, Yunlong Fu, Jie Zhang et Yin Luo. « Deep Learning Approaches in Tight Gas Field Pay Zone Classification ». Dans SPE Argentina Exploration and Production of Unconventional Resources Symposium. SPE, 2023. http://dx.doi.org/10.2118/212394-ms.
Texte intégralAhmadov, Jamal. « Utilizing Data-Driven Models to Predict Brittleness in Tuscaloosa Marine Shale : A Machine Learning Approach ». Dans SPE Annual Technical Conference and Exhibition. SPE, 2021. http://dx.doi.org/10.2118/208628-stu.
Texte intégralBarreto Fernandes, Francisco António, et Bernabé Hernandis Ortuño. « Usability and User-Centered Design - User Evaluation Experience in Self-Checkout Technologies ». Dans Systems & Design 2017. Valencia : Universitat Politècnica València, 2017. http://dx.doi.org/10.4995/sd2017.2017.6634.
Texte intégralAndov, Stojan, Violeta Cvetkoska et Tea Mijac. « Unveiling Global Road Accident Patterns - Insights, Analytics, and Implications for Safer Driving Practices ». Dans 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.
Texte intégral