Статті в журналах з теми "Randomised search algorithms"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Randomised search algorithms".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Jansen, Thomas, and Christine Zarges. "Analysis of Randomised Search Heuristics for Dynamic Optimisation." Evolutionary Computation 23, no. 4 (December 2015): 513–41. http://dx.doi.org/10.1162/evco_a_00164.
Повний текст джерелаXiao, Peng, Soumitra Pal, and Sanguthevar Rajasekaran. "Randomised sequential and parallel algorithms for efficient quorum planted motif search." International Journal of Data Mining and Bioinformatics 18, no. 2 (2017): 105. http://dx.doi.org/10.1504/ijdmb.2017.086457.
Повний текст джерелаXiao, Peng, Soumitra Pal, and Sanguthevar Rajasekaran. "Randomised sequential and parallel algorithms for efficient quorum planted motif search." International Journal of Data Mining and Bioinformatics 18, no. 2 (2017): 105. http://dx.doi.org/10.1504/ijdmb.2017.10007475.
Повний текст джерелаLissovoi, Andrei, Pietro S. Oliveto, and John Alasdair Warwicker. "On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2322–29. http://dx.doi.org/10.1609/aaai.v33i01.33012322.
Повний текст джерелаLissovoi, Andrei, Pietro S. Oliveto, and John Alasdair Warwicker. "Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes." Evolutionary Computation 28, no. 3 (September 2020): 437–61. http://dx.doi.org/10.1162/evco_a_00258.
Повний текст джерелаCorus, Dogan, and Pietro S. Oliveto. "On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms." Algorithmica 82, no. 12 (July 15, 2020): 3676–706. http://dx.doi.org/10.1007/s00453-020-00743-1.
Повний текст джерелаSerraino, Giuseppe Filiberto, and Gavin J. Murphy. "Effects of cerebral near-infrared spectroscopy on the outcome of patients undergoing cardiac surgery: a systematic review of randomised trials." BMJ Open 7, no. 9 (September 2017): e016613. http://dx.doi.org/10.1136/bmjopen-2017-016613.
Повний текст джерелаHassan, N., R. Slight, D. Weiand, A. Vellinga, G. Morgan, F. Aboushareb, and S. P. Slight. "Predicting infection and sepsis; what predictors have been used to train machine learning algorithms? A systematic review." International Journal of Pharmacy Practice 29, Supplement_1 (March 26, 2021): i18. http://dx.doi.org/10.1093/ijpp/riab016.022.
Повний текст джерелаOliva, Antonio, Gerardo Altamura, Mario Cesare Nurchis, Massimo Zedda, Giorgio Sessa, Francesca Cazzato, Giovanni Aulino, et al. "Assessing the potentiality of algorithms and artificial intelligence adoption to disrupt patient primary care with a safer and faster medication management: a systematic review protocol." BMJ Open 12, no. 5 (May 2022): e057399. http://dx.doi.org/10.1136/bmjopen-2021-057399.
Повний текст джерелаTett, Simon F. B., Kuniko Yamazaki, Michael J. Mineter, Coralia Cartis, and Nathan Eizenberg. "Calibrating climate models using inverse methods: case studies with HadAM3, HadAM3P and HadCM3." Geoscientific Model Development 10, no. 9 (September 28, 2017): 3567–89. http://dx.doi.org/10.5194/gmd-10-3567-2017.
Повний текст джерелаWilson, GDF. "A phylogenetic analysis of the isopod family Janiridae (Crustacea)." Invertebrate Systematics 8, no. 3 (1994): 749. http://dx.doi.org/10.1071/it9940749.
Повний текст джерелаCamungao, Ricardo Q. "Slim-Tree Clustering Large Application based on Randomized Search (STCLARANS) Algorithm Simulator." Journal of Advanced Research in Dynamical and Control Systems 11, no. 12-SPECIAL ISSUE (December 31, 2019): 1253–58. http://dx.doi.org/10.5373/jardcs/v11sp12/20193333.
Повний текст джерелаMishra, Abhishek, and Pramod Kumar Mishra. "A Randomized Scheduling Algorithm for Multiprocessor Environments Using Local Search." Parallel Processing Letters 26, no. 01 (March 2016): 1650002. http://dx.doi.org/10.1142/s012962641650002x.
Повний текст джерелаCresswell, Kathrin, Margaret Callaghan, Sheraz Khan, Zakariya Sheikh, Hajar Mozaffar, and Aziz Sheikh. "Investigating the use of data-driven artificial intelligence in computerised decision support systems for health and social care: A systematic review." Health Informatics Journal 26, no. 3 (January 22, 2020): 2138–47. http://dx.doi.org/10.1177/1460458219900452.
Повний текст джерелаGelly, Sylvain, Sylvie Ruette, and Olivier Teytaud. "Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime." Evolutionary Computation 15, no. 4 (December 2007): 411–34. http://dx.doi.org/10.1162/evco.2007.15.4.411.
Повний текст джерелаWilson, William G., William G. Laidlaw, and Kris Vasudevan. "Residual statics estimation using the genetic algorithm." GEOPHYSICS 59, no. 5 (May 1994): 766–74. http://dx.doi.org/10.1190/1.1443634.
Повний текст джерелаKazakovtsev, Lev, Dmitry Stashkov, Mikhail Gudyma, and Vladimir Kazakovtsev. "Algorithms with greedy heuristic procedures for mixture probability distribution separation." Yugoslav Journal of Operations Research 29, no. 1 (2019): 51–67. http://dx.doi.org/10.2298/yjor171107030k.
Повний текст джерелаLitvinas, Linas. "A hybrid of Bayesian-based global search with Hooke–Jeeves local refinement for multi-objective optimization problems." Nonlinear Analysis: Modelling and Control 27 (March 28, 2022): 1–22. http://dx.doi.org/10.15388/namc.2022.27.26558.
Повний текст джерелаSung, Chi Wan, and Shiu Yin Yuen. "Analysis of (1+1) Evolutionary Algorithm and Randomized Local Search with Memory." Evolutionary Computation 19, no. 2 (June 2011): 287–323. http://dx.doi.org/10.1162/evco_a_00029.
Повний текст джерелаArunkumar, S., and T. Chockalingam. "Genetic search algorithms and their randomized operators." Computers & Mathematics with Applications 25, no. 5 (March 1993): 91–100. http://dx.doi.org/10.1016/0898-1221(93)90202-7.
Повний текст джерелаMühlenthaler, Moritz, and Alexander Raß. "Runtime analysis of discrete particle swarm optimization algorithms: A survey." it - Information Technology 61, no. 4 (August 27, 2019): 177–85. http://dx.doi.org/10.1515/itit-2019-0009.
Повний текст джерелаGelfand, Andrew, Kalev Kask, and Rina Dechter. "Stopping Rules for Randomized Greedy Triangulation Schemes." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (August 4, 2011): 1043–48. http://dx.doi.org/10.1609/aaai.v25i1.8021.
Повний текст джерелаSørensen, Anders, Karsten Juhl Jørgensen, and Klaus Munkholm. "Clinical practice guideline recommendations on tapering and discontinuing antidepressants for depression: a systematic review." Therapeutic Advances in Psychopharmacology 12 (January 2022): 204512532110676. http://dx.doi.org/10.1177/20451253211067656.
Повний текст джерелаOdili, Julius Beneoluchi, A. Noraziah, and M. Zarina. "A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem." Computational Intelligence and Neuroscience 2021 (April 20, 2021): 1–13. http://dx.doi.org/10.1155/2021/6625438.
Повний текст джерелаHui, L. C. K. "Randomized Competitive Algorithms for Successful and Unsuccessful Search." Computer Journal 39, no. 5 (May 1, 1996): 427–38. http://dx.doi.org/10.1093/comjnl/39.5.427.
Повний текст джерелаFränti, P., and J. Kivijärvi. "Randomised Local Search Algorithm for the Clustering Problem." Pattern Analysis & Applications 3, no. 4 (December 1, 2000): 358–69. http://dx.doi.org/10.1007/s100440070007.
Повний текст джерелаKazakovtsev, Lev, Ivan Rozhnov, Aleksey Popov, and Elena Tovbis. "Self-Adjusting Variable Neighborhood Search Algorithm for Near-Optimal k-Means Clustering." Computation 8, no. 4 (November 5, 2020): 90. http://dx.doi.org/10.3390/computation8040090.
Повний текст джерелаCHAN, TIMOTHY M. "ON ENUMERATING AND SELECTING DISTANCES." International Journal of Computational Geometry & Applications 11, no. 03 (June 2001): 291–304. http://dx.doi.org/10.1142/s0218195901000511.
Повний текст джерелаHadka, David, and Patrick Reed. "Borg: An Auto-Adaptive Many-Objective Evolutionary Computing Framework." Evolutionary Computation 21, no. 2 (May 2013): 231–59. http://dx.doi.org/10.1162/evco_a_00075.
Повний текст джерелаDAVILA, JAIME, and SANGUTHEVAR RAJASEKARAN. "RANDOMIZED SORTING ON THE POPS NETWORK." International Journal of Foundations of Computer Science 16, no. 01 (February 2005): 105–16. http://dx.doi.org/10.1142/s0129054105002899.
Повний текст джерелаZhang, Yongfei, Jun Wu, Liming Zhang, Peng Zhao, Junping Zhou, and Minghao Yin. "An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem." Mathematical Problems in Engineering 2018 (September 6, 2018): 1–10. http://dx.doi.org/10.1155/2018/3935804.
Повний текст джерелаBabaie-Kafaki, Saman, and Saeed Rezaee. "A randomized adaptive trust region line search method." An International Journal of Optimization and Control: Theories & Applications (IJOCTA) 10, no. 2 (July 27, 2020): 259–63. http://dx.doi.org/10.11121/ijocta.01.2020.00900.
Повний текст джерелаVan Haaren, Jan, and Jesse Davis. "Markov Network Structure Learning: A Randomized Feature Generation Approach." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 1148–54. http://dx.doi.org/10.1609/aaai.v26i1.8315.
Повний текст джерелаChoi, Jung Chan, Zhongqiang Liu, Suzanne Lacasse, and Elin Skurtveit. "Leak-Off Pressure Using Weakly Correlated Geospatial Information and Machine Learning Algorithms." Geosciences 11, no. 4 (April 19, 2021): 181. http://dx.doi.org/10.3390/geosciences11040181.
Повний текст джерелаBang, Ban Ha. "EFFICIENT METAHEURISTIC ALGORITHMS FOR THE MULTI-STRIPE TRAVELLING SALESMAN PROBLEM." Journal of Computer Science and Cybernetics 36, no. 3 (August 18, 2020): 233–50. http://dx.doi.org/10.15625/1813-9663/36/3/14770.
Повний текст джерелаLonklang, Aphilak, and János Botzheim. "Improved Rapidly Exploring Random Tree with Bacterial Mutation and Node Deletion for Offline Path Planning of Mobile Robot." Electronics 11, no. 9 (May 3, 2022): 1459. http://dx.doi.org/10.3390/electronics11091459.
Повний текст джерелаQiang, Ning, and Feng Ju Kang. "A Hybrid Particle Swarm Optimization for Solving Vehicle Routing Problem with Stochastic Demands." Advanced Materials Research 971-973 (June 2014): 1467–72. http://dx.doi.org/10.4028/www.scientific.net/amr.971-973.1467.
Повний текст джерелаPan, Jia, Christian Lauterbach, and Dinesh Manocha. "g-Planner: Real-time Motion Planning and Global Navigation using GPUs." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 4, 2010): 1245–51. http://dx.doi.org/10.1609/aaai.v24i1.7732.
Повний текст джерелаNgo, Son Tung, Jafreezal Jaafar, Aziz Abdul Izzatdin, Giang Truong Tong, and Anh Ngoc Bui. "Some metaheuristic algorithms for solving multiple cross-functional team selection problems." PeerJ Computer Science 8 (August 9, 2022): e1063. http://dx.doi.org/10.7717/peerj-cs.1063.
Повний текст джерелаMorgan, R., and M. Gallagher. "Using Landscape Topology to Compare Continuous Metaheuristics: A Framework and Case Study on EDAs and Ridge Structure." Evolutionary Computation 20, no. 2 (June 2012): 277–99. http://dx.doi.org/10.1162/evco_a_00070.
Повний текст джерелаDEVILLERS, OLIVIER, and PHILIPPE GUIGUE. "THE SHUFFLING BUFFER." International Journal of Computational Geometry & Applications 11, no. 05 (October 2001): 555–72. http://dx.doi.org/10.1142/s021819590100064x.
Повний текст джерелаHu, Ta-Yin, and Li-Wen Chen. "Traffic Signal Optimization with Greedy Randomized Tabu Search Algorithm." Journal of Transportation Engineering 138, no. 8 (August 2012): 1040–50. http://dx.doi.org/10.1061/(asce)te.1943-5436.0000404.
Повний текст джерелаLENGLER, J., and A. STEGER. "Drift Analysis and Evolutionary Algorithms Revisited." Combinatorics, Probability and Computing 27, no. 4 (June 20, 2018): 643–66. http://dx.doi.org/10.1017/s0963548318000275.
Повний текст джерелаWANG, LUSHENG, and LIANG DONG. "RANDOMIZED ALGORITHMS FOR MOTIF DETECTION." Journal of Bioinformatics and Computational Biology 03, no. 05 (October 2005): 1039–52. http://dx.doi.org/10.1142/s0219720005001508.
Повний текст джерелаBabaie-Kafaki, Saman, and Saeed Rezaee. "A randomized nonmonotone adaptive trust region method based on the simulated annealing strategy for unconstrained optimization." International Journal of Intelligent Computing and Cybernetics 12, no. 3 (August 12, 2019): 389–99. http://dx.doi.org/10.1108/ijicc-12-2018-0178.
Повний текст джерелаXiao, Xue, Qing Hong Wu, and Ying Zhang. "Recognition of Paper Currency Research Based on AGA-BP Neural Network." Advanced Materials Research 989-994 (July 2014): 3968–72. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.3968.
Повний текст джерелаKarp, Richard M., and Yanjun Zhang. "Randomized parallel algorithms for backtrack search and branch-and-bound computation." Journal of the ACM 40, no. 3 (July 1993): 765–89. http://dx.doi.org/10.1145/174130.174145.
Повний текст джерелаNeumann, Frank, and Ingo Wegener. "Randomized local search, evolutionary algorithms, and the minimum spanning tree problem." Theoretical Computer Science 378, no. 1 (June 2007): 32–40. http://dx.doi.org/10.1016/j.tcs.2006.11.002.
Повний текст джерелаBuaba, Ruben, Abdollah Homaifar, William Hendrix, Seung Son, Wei-keng Liao, and Alok Choudhary. "Randomized Algorithm for Approximate Nearest Neighbor Search in High Dimensions." Journal of Pattern Recognition Research 9, no. 1 (2014): 111–22. http://dx.doi.org/10.13176/11.599.
Повний текст джерелаRaja Balachandar, S., and K. Kannan. "Randomized gravitational emulation search algorithm for symmetric traveling salesman problem." Applied Mathematics and Computation 192, no. 2 (September 2007): 413–21. http://dx.doi.org/10.1016/j.amc.2007.03.019.
Повний текст джерела