Добірка наукової літератури з теми "Splitting algorithm"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Splitting algorithm".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Splitting algorithm"
Luo, Zhi Kang, Huai Ying Sun, and De Wang. "An Improved SPRINT Algorithm." Advanced Materials Research 532-533 (June 2012): 1685–90. http://dx.doi.org/10.4028/www.scientific.net/amr.532-533.1685.
Повний текст джерелаChen, Jinjian, Xingyu Luo, Yuchao Tang, and Qiaoli Dong. "Primal-Dual Splitting Algorithms for Solving Structured Monotone Inclusion with Applications." Symmetry 13, no. 12 (December 13, 2021): 2415. http://dx.doi.org/10.3390/sym13122415.
Повний текст джерелаHai, Trinh Ngoc, and Ngo Thi Thuong. "A new splitting algorithm for equilibrium problems and applications." Studia Universitatis Babes-Bolyai Matematica 67, no. 1 (March 10, 2022): 129–44. http://dx.doi.org/10.24193/subbmath.2022.1.09.
Повний текст джерелаAsqool, Obada, Suhana Koting, and Ahmad Saifizul. "Evaluation of Outlier Filtering Algorithms for Accurate Travel Time Measurement Incorporating Lane-Splitting Situations." Sustainability 13, no. 24 (December 15, 2021): 13851. http://dx.doi.org/10.3390/su132413851.
Повний текст джерелаAshley, J., and B. H. Marcus. "A generalized state-splitting algorithm." IEEE Transactions on Information Theory 43, no. 4 (July 1997): 1326–38. http://dx.doi.org/10.1109/18.605603.
Повний текст джерелаKripac, Jiri. "Algorithm for splitting planar faces." Computer-Aided Design 19, no. 6 (July 1987): 293–98. http://dx.doi.org/10.1016/0010-4485(87)90282-x.
Повний текст джерелаWalraven, F. F. Y., and P. V. Van Rompay. "An improved phase-splitting algorithm." Computers & Chemical Engineering 12, no. 8 (August 1988): 777–82. http://dx.doi.org/10.1016/0098-1354(88)80015-2.
Повний текст джерелаZhang, Xiaoyu, Genxiang Chen, and Qi Zhang. "LCOS-SLM Based Intelligent Hybrid Algorithm for Beam Splitting." Electronics 11, no. 3 (January 30, 2022): 428. http://dx.doi.org/10.3390/electronics11030428.
Повний текст джерелаZong, Chunxiang, Yuchao Tang, and Yeol Cho. "Convergence Analysis of an Inexact Three-Operator Splitting Algorithm." Symmetry 10, no. 11 (November 1, 2018): 563. http://dx.doi.org/10.3390/sym10110563.
Повний текст джерелаSun, Yong Yong, and Guang Qiu Huang. "Technique of Code Obfuscation Based on Class Splitting." Applied Mechanics and Materials 271-272 (December 2012): 636–40. http://dx.doi.org/10.4028/www.scientific.net/amm.271-272.636.
Повний текст джерелаДисертації з теми "Splitting algorithm"
Bot, Radu Ioan, Ernö Robert Csetnek, and Erika Nagy. "Solving systems of monotone inclusions via primal-dual splitting techniques." Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-108172.
Повний текст джерелаSalinger, David H. "A splitting algorithm for multistage stochastic programming with application to hydropower scheduling /." Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/6749.
Повний текст джерелаHendrich, Christopher. "Proximal Splitting Methods in Nonsmooth Convex Optimization." Doctoral thesis, Universitätsbibliothek Chemnitz, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-149548.
Повний текст джерелаBirba, Delwende Eliane. "A Comparative study of data splitting algorithms for machine learning model selection." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-287194.
Повний текст джерелаDatapartitionering används vanligtvis i maskininlärning för att dela data i en tränings, test eller valideringsuppsättning. Detta tillvägagångssätt gör det möjligt för oss att hitta hyperparametrar för modellen och även uppskatta generaliseringsprestanda. I denna forskning genomförde vi en jämförande analys av olika datapartitionsalgoritmer på både verkliga och simulerade data. Vårt huvudmål var att undersöka frågan om hur valet avdatapartitioneringsalgoritm kan förbättra uppskattningen av generaliseringsprestanda. Datapartitioneringsalgoritmer som användes i denna studie var varianter av k-faldig korsvalidering, Kennard-Stone (KS), SPXY (partitionering baserat på gemensamt x-y-avstånd) och bootstrap-algoritm. Varje algoritm användes för att dela upp data i två olika datamängder: tränings- och valideringsdata. Vi analyserade sedan de olika datapartitioneringsalgoritmerna baserat på generaliseringsprestanda uppskattade från valideringen och den externa testuppsättningen. Från resultatet noterade vi att det avgörande för en bra generalisering är storleken på data. För alla datapartitioneringsalgoritmer som använts på små datamängder var klyftan mellan prestanda uppskattad på valideringen och testuppsättningen betydande. Vi noterade emellertid att gapet minskade när det fanns mer data för träning eller validering. För mycket eller för litet data i träningsuppsättningen kan också leda till dålig prestanda. Detta belyser vikten av att ha en korrekt balans mellan storlekarna på tränings- och valideringsmängderna. I vår studie var KS och SPXY de algoritmer med sämst prestanda. Dessa metoder väljer de mest representativa instanserna för att träna modellen, och icke-representativa instanser lämnas för uppskattning av modellprestanda.
Nagurney, Anna, and Alexander Eydeland. "A Splitting Equilibration Algorithm for the Computation of Large-Scale Constrained Matrix Problems; Theoretical Analysis and Applications." Massachusetts Institute of Technology, Operations Research Center, 1990. http://hdl.handle.net/1721.1/5316.
Повний текст джерелаGlaudin, Lilian. "Stratégies multicouche, avec mémoire, et à métrique variable en méthodes de point fixe pour l'éclatement d'opérateurs monotones et l'optimisation." Thesis, Sorbonne université, 2019. http://www.theses.fr/2019SORUS119.
Повний текст джерелаSeveral apparently unrelated strategies coexist to implement algorithms for solving monotone inclusions in Hilbert spaces. We propose a synthetic framework for fixed point construction which makes it possible to capture various algorithmic approaches, clarify and generalize their asymptotic behavior, and design new iterative schemes for nonlinear analysis and convex optimization. Our methodology, which is anchored on an averaged quasinonexpansive operator composition model, allows us to advance the theory of fixed point algorithms on several fronts, and to impact their application fields. Numerical examples are provided in the context of image restoration, where we propose a new viewpoint on the formulation of variational problems
Uygur, Ahmet Bilge. "A Non-iterative Pressure Based Algorithm For The Computation Of Reacting Radiating Flows." Phd thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608274/index.pdf.
Повний текст джерелаwere benchmarked against experimental data and numerical solutions available in the literature and the capability of the code to predict transient solutions was demonstrated on these test cases. Favorable agreements were obtained for both test cases. The effect of radiation and non-gray treatment of the radiative properties were investigated on the second test case. It was found that incorporation of radiation has significant effect on Temeprature and velocity fields but its effect is limited in species predictions. Executions with both radiation models revealed that the non-gray radiation model considered in the present study produces similar results with the gray model at a considerably higher computational cost. The algorithm developed was found to be an efficient and versatile tool for the timedependent simulation of different flow scenarios constitutes the initial steps towards the computation of transient turbulent combustion.
Karmouche, El Mostafa. "Modélisation complémentaire des signaux non-stationnaires." Nancy 1, 1993. http://www.theses.fr/1993NAN10015.
Повний текст джерелаHiltunen, Sonja. "Proximal Splitting Algorithms for Disparity Estimation Using Convex Relaxation." Thesis, KTH, Ljud- och bildbehandling, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-55342.
Повний текст джерелаDarapuram, Rajasekhar Venkata. "AN INVESTIGATION OF FLUX-SPLITTING ALGORITHMS FOR CHEMICALLY REACTING FLOWS." MSSTATE, 2001. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04102001-104000/.
Повний текст джерелаКниги з теми "Splitting algorithm"
Siebert, Christian. A scalable parallel sorting algorithm using exact splitting. Aachen: Universitätsbibliothek der RWTH Aachen, 2011.
Знайти повний текст джерелаNASA Dryden Flight Research Center., ed. A parallel, finite-volume algorithm for large-eddy simulation of turbulent flows. Edwards, Calif: National Aeronautics and Space Administration, Dryden Flight Research Center, 1999.
Знайти повний текст джерелаNASA Dryden Flight Research Center., ed. A parallel, finite-volume algorithm for large-eddy simulation of turbulent flows. Edwards, Calif: National Aeronautics and Space Administration, Dryden Flight Research Center, 1999.
Знайти повний текст джерелаBui, Trong T. A parallel, finite-volume algorithm for large-eddy simulation of turbulent flows. Edwards, Calif: National Aeronautics and Space Administration, Dryden Flight Research Center, 1999.
Знайти повний текст джерелаNASA Dryden Flight Research Center., ed. A parallel, finite-volume algorithm for large-eddy simulation of turbulent flows. Edwards, Calif: National Aeronautics and Space Administration, Dryden Flight Research Center, 1999.
Знайти повний текст джерелаNASA Dryden Flight Research Center., ed. A parallel, finite-volume algorithm for large-eddy simulation of turbulent flows. Edwards, Calif: National Aeronautics and Space Administration, Dryden Flight Research Center, 1999.
Знайти повний текст джерелаBauschke, Heinz H., Regina S. Burachik, and D. Russell Luke, eds. Splitting Algorithms, Modern Operator Theory, and Applications. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25939-6.
Повний текст джерелаAnderson, W. Kyle. Three-dimensional multigrid algorithms for the flux-split Euler equations. Hampton, Va: Langley Research Center, 1988.
Знайти повний текст джерела1952-, Thomas James L., Whitfield David L, and United States. National Aeronautics and Space Administration. Scientific and Technical Information Division., eds. Three-dimensional multigrid algorithms for the flux-split Euler equations. [Washington, D.C.]: National Aeronautics and Space Administration, Scientific and Technical Information Division, 1989.
Знайти повний текст джерелаAnderson, W. Kyle. Three-dimensional multigrid algorithms for the flux-split Euler equations. [Washington, D.C.]: National Aeronautics and Space Administration, Scientific and Technical Information Division, 1989.
Знайти повний текст джерелаЧастини книг з теми "Splitting algorithm"
Dehne, Frank, Michael R. Fellows, and Frances A. Rosamond. "An FPT Algorithm for Set Splitting." In Graph-Theoretic Concepts in Computer Science, 180–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39890-5_16.
Повний текст джерелаLokshtanov, Daniel, and Saket Saurabh. "Even Faster Algorithm for Set Splitting!" In Parameterized and Exact Computation, 288–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-11269-0_24.
Повний текст джерелаLiu, Jun, and Kotagiri Ramamohanarao. "Improved Self-splitting Competitive Learning Algorithm." In Advances in Knowledge Discovery and Data Mining, 372–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11430919_44.
Повний текст джерелаLee, Jaeho, JoonYoung Park, Deok-Soo Kim, and HyunChan Lee. "Polyhedron Splitting Algorithm for 3D Layer Generation." In Computational Science and Its Applications – ICCSA 2004, 564–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24709-8_60.
Повний текст джерелаKhoder, Rami, Rola Naja, and Samir Tohme. "Performance Evaluation of Speed Platoon Splitting Algorithm." In Advances in Intelligent Systems and Computing, 31–42. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-3750-9_3.
Повний текст джерелаAhmed, Reyan, Stephen Kobourov, and Myroslav Kryven. "An FPT Algorithm for Bipartite Vertex Splitting." In Lecture Notes in Computer Science, 261–68. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-22203-0_19.
Повний текст джерелаAng, C. H., and T. C. Tan. "New linear node splitting algorithm for R-trees." In Advances in Spatial Databases, 337–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63238-7_38.
Повний текст джерелаSetzer, Simon. "Split Bregman Algorithm, Douglas-Rachford Splitting and Frame Shrinkage." In Lecture Notes in Computer Science, 464–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02256-2_39.
Повний текст джерелаGorskikh, Olga. "Splitting Algorithm for Detecting Structural Changes in Predictive Relationships." In Advances in Data Mining. Applications and Theoretical Aspects, 405–19. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41561-1_30.
Повний текст джерелаMola, Francesco, and Roberta Siciliano. "A Two-Stage Predictive Splitting Algorithm in Binary Segmentation." In Computational Statistics, 179–84. Heidelberg: Physica-Verlag HD, 1992. http://dx.doi.org/10.1007/978-3-662-26811-7_26.
Повний текст джерелаТези доповідей конференцій з теми "Splitting algorithm"
Wang, Liping, and Wenhui Fan. "Research of Optimal Splitting Level of Splitting Algorithm." In 2018 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData). IEEE, 2018. http://dx.doi.org/10.1109/cybermatics_2018.2018.00154.
Повний текст джерелаWu, Liang, Guang Tian, and Zhong Xie. "An Algorithm for Splitting Arbitrary Polygon." In 2009 Fifth International Conference on Natural Computation. IEEE, 2009. http://dx.doi.org/10.1109/icnc.2009.201.
Повний текст джерелаMontacié, Claude, and Marie-José Caraty. "A silence/noise/music/speech splitting algorithm." In 5th International Conference on Spoken Language Processing (ICSLP 1998). ISCA: ISCA, 1998. http://dx.doi.org/10.21437/icslp.1998-597.
Повний текст джерелаShumilov, B. M., and S. M. Matanov. "Supercompact cubic multiwavelets and algorithm with splitting." In 2011 International Conference on Multimedia Technology (ICMT). IEEE, 2011. http://dx.doi.org/10.1109/icmt.2011.6002586.
Повний текст джерела"A Splitting Algorithm for Medical Image Denoising." In Special Session on Modelling and Simulation in Biology and Medicine. SciTePress - Science and and Technology Publications, 2013. http://dx.doi.org/10.5220/0004634407040709.
Повний текст джерелаShaheen, Ahmed Maher Abed, and Kaydar M. Quboa. "Pole Splitting algorithm for UWB breast cancer imaging." In MELECON 2012 - 2012 16th IEEE Mediterranean Electrotechnical Conference. IEEE, 2012. http://dx.doi.org/10.1109/melcon.2012.6196462.
Повний текст джерелаGore, Ashutosh Deepak, and Abhay Karandikar. "Power Controlled FCFS Splitting Algorithm for Wireless Networks." In MILCOM 2007 - IEEE Military Communications Conference. IEEE, 2007. http://dx.doi.org/10.1109/milcom.2007.4454867.
Повний текст джерелаTanab, Manal El, Yasmine Fahmy, and Mohamed M. Khairy. "Opportunistic splitting algorithm for underlay cognitive radio networks." In 2014 Sixth International Conference on Ubiquitous and Future Networks (ICUFN). IEEE, 2014. http://dx.doi.org/10.1109/icufn.2014.6876738.
Повний текст джерелаKohle and Schonbauer. "Segregation algorithm: splitting the training set improves learning." In International Joint Conference on Neural Networks. IEEE, 1989. http://dx.doi.org/10.1109/ijcnn.1989.118505.
Повний текст джерелаXiangping Qin and R. Berry. "A distributed splitting algorithm for exploiting multiuser diversity." In IEEE International Symposium on Information Theory, 2003. Proceedings. IEEE, 2003. http://dx.doi.org/10.1109/isit.2003.1228385.
Повний текст джерелаЗвіти організацій з теми "Splitting algorithm"
O'Neill, Francis, Kristofer Lasko, and Elena Sava. Snow-covered region improvements to a support vector machine-based semi-automated land cover mapping decision support tool. Engineer Research and Development Center (U.S.), November 2022. http://dx.doi.org/10.21079/11681/45842.
Повний текст джерела