Статті в журналах з теми "Random combinatorial problems"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Random combinatorial problems".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Coja-Oghlan, Amin, Tobias Kapetanopoulos, and Noela Müller. "The replica symmetric phase of random constraint satisfaction problems." Combinatorics, Probability and Computing 29, no. 3 (December 3, 2019): 346–422. http://dx.doi.org/10.1017/s0963548319000440.
Повний текст джерелаSerafini, Paolo. "Combinatorial optimization problems with normal random costs." Operations Research Letters 41, no. 2 (March 2013): 126–33. http://dx.doi.org/10.1016/j.orl.2012.11.014.
Повний текст джерелаGalbiati, G., and F. Maffioli. "Random pseudo-polynomial algorithms for some combinatorial programming problems." European Journal of Operational Research 58, no. 2 (April 1992): 223–35. http://dx.doi.org/10.1016/0377-2217(92)90209-r.
Повний текст джерелаLeone, Michele, Federico Ricci-Tersenghi, and Riccardo Zecchina. "Phase coexistence and finite-size scaling in random combinatorial problems." Journal of Physics A: Mathematical and General 34, no. 22 (May 24, 2001): 4615–26. http://dx.doi.org/10.1088/0305-4470/34/22/303.
Повний текст джерелаReznik, A. L., A. A. Soloviev, and A. V. Torgov. "Programs of Recursive Analytical Calculations in Problems of Random Point Images Analysis." Izvestiya of Altai State University, no. 4(114) (September 9, 2020): 112–16. http://dx.doi.org/10.14258/izvasu(2020)4-18.
Повний текст джерелаKuchinskii, É. Z., and M. V. Sadovskii. "Combinatorial analysis of Feynman diagrams in problems with a Gaussian random field." Journal of Experimental and Theoretical Physics 86, no. 2 (February 1998): 367–74. http://dx.doi.org/10.1134/1.558437.
Повний текст джерелаLiu, Yucheng, and Zhichao Wang. "Some Generalizations of Random Broken and Pick-up Stick Problems." Journal of Physics: Conference Series 2287, no. 1 (June 1, 2022): 012003. http://dx.doi.org/10.1088/1742-6596/2287/1/012003.
Повний текст джерелаBouhmala, Noureddine, and Ole-Christoffer Granmo. "Stochastic Learning for SAT- Encoded Graph Coloring Problems." International Journal of Applied Metaheuristic Computing 1, no. 3 (July 2010): 1–19. http://dx.doi.org/10.4018/jamc.2010070101.
Повний текст джерелаKNIZHNIK, V. G., A. M. POLYAKOV, and A. B. ZAMOLODCHIKOV. "FRACTAL STRUCTURE OF 2d—QUANTUM GRAVITY." Modern Physics Letters A 03, no. 08 (July 1988): 819–26. http://dx.doi.org/10.1142/s0217732388000982.
Повний текст джерелаReznik, A. L., A. A. Solov’ev, and A. V. Torgov. "Program-combinatorial approach to solving problems of error-free readout of random point images." Optoelectronics, Instrumentation and Data Processing 52, no. 2 (March 2016): 121–27. http://dx.doi.org/10.3103/s8756699016020035.
Повний текст джерелаBarrett, Thomas, William Clements, Jakob Foerster, and Alex Lvovsky. "Exploratory Combinatorial Optimization with Reinforcement Learning." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (April 3, 2020): 3243–50. http://dx.doi.org/10.1609/aaai.v34i04.5723.
Повний текст джерелаAmaro, David, Carlo Modica, Matthias Rosenkranz, Mattia Fiorentini, Marcello Benedetti, and Michael Lubasch. "Filtering variational quantum algorithms for combinatorial optimization." Quantum Science and Technology 7, no. 1 (January 1, 2022): 015021. http://dx.doi.org/10.1088/2058-9565/ac3e54.
Повний текст джерелаEl Majdoubi, Omayma, Farah Abdoun, and Otman Abdoun. "An improved approach to resolve a combinatorial optimization problem based CoronaVirus Optimization Algorithm." E3S Web of Conferences 351 (2022): 01025. http://dx.doi.org/10.1051/e3sconf/202235101025.
Повний текст джерелаGehring, Wolfgang, Peter Salamon, Roger E. Whitney, and Paolo Sibani. "Correlation Structure of Landscapes of NP-Complete Optimization Problems at Finite Temperatures." Open Systems & Information Dynamics 11, no. 02 (June 2004): 177–84. http://dx.doi.org/10.1023/b:opsy.0000034195.19292.a0.
Повний текст джерелаZhou, Guangyan, and Rui Kang. "On the Lower Bounds of (1,0)-Super Solutions for Random k-SAT." International Journal of Foundations of Computer Science 30, no. 02 (February 2019): 247–54. http://dx.doi.org/10.1142/s0129054119500035.
Повний текст джерелаBelozerov, Ilya Andreevich, and Vladimir Anatolievich Sudakov. "Reinforcement Machine Learning for Solving Mathematical Programming Problems." Keldysh Institute Preprints, no. 36 (2022): 1–14. http://dx.doi.org/10.20948/prepr-2022-36.
Повний текст джерелаEgger, Daniel J., Jakub Mareček, and Stefan Woerner. "Warm-starting quantum optimization." Quantum 5 (June 17, 2021): 479. http://dx.doi.org/10.22331/q-2021-06-17-479.
Повний текст джерелаCrane, Harry, and Walter Dempsey. "Relational exchangeability." Journal of Applied Probability 56, no. 01 (March 2019): 192–208. http://dx.doi.org/10.1017/jpr.2019.13.
Повний текст джерелаSrinivasan, Sriram, Behrouz Babaki, Golnoosh Farnadi, and Lise Getoor. "Lifted Hinge-Loss Markov Random Fields." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 7975–83. http://dx.doi.org/10.1609/aaai.v33i01.33017975.
Повний текст джерелаChilds, A. M., E. Farhi, J. Goldstone, and S. Gutmann. "Finding cliques by quantum adiabatic evolution." Quantum Information and Computation 2, no. 3 (April 2002): 181–91. http://dx.doi.org/10.26421/qic2.3-1.
Повний текст джерелаDu, Yihan, Yuko Kuroki, and Wei Chen. "Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 8 (May 18, 2021): 7262–70. http://dx.doi.org/10.1609/aaai.v35i8.16892.
Повний текст джерелаSezer, Ali Devin, and Ferruh Özbudak. "Approximation of bounds on mixed-level orthogonal arrays." Advances in Applied Probability 43, no. 2 (June 2011): 399–421. http://dx.doi.org/10.1239/aap/1308662485.
Повний текст джерелаSezer, Ali Devin, and Ferruh Özbudak. "Approximation of bounds on mixed-level orthogonal arrays." Advances in Applied Probability 43, no. 02 (June 2011): 399–421. http://dx.doi.org/10.1017/s0001867800004912.
Повний текст джерелаKarlin, Samuel. "Coincident probabilities and applications in combinatorics." Journal of Applied Probability 25, A (1988): 185–200. http://dx.doi.org/10.2307/3214156.
Повний текст джерелаKarlin, Samuel. "Coincident probabilities and applications in combinatorics." Journal of Applied Probability 25, A (1988): 185–200. http://dx.doi.org/10.1017/s0021900200040353.
Повний текст джерелаZhang, W. "Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem." Journal of Artificial Intelligence Research 21 (April 1, 2004): 471–97. http://dx.doi.org/10.1613/jair.1389.
Повний текст джерелаGarcía, José, Paola Moraga, Matias Valenzuela, Broderick Crawford, Ricardo Soto, Hernan Pinto, Alvaro Peña, Francisco Altimiras, and Gino Astorga. "A Db-Scan Binarization Algorithm Applied to Matrix Covering Problems." Computational Intelligence and Neuroscience 2019 (September 16, 2019): 1–16. http://dx.doi.org/10.1155/2019/3238574.
Повний текст джерелаQawqzeh, Yousef K., Ghaith Jaradat, Ali Al-Yousef, Anmar Abu-Hamdah, Ibrahim Almarashdeh, Mutasem Alsmadi, Mohammed Tayfour, Khalid Shaker, and Firas Haddad. "Applying the big bang-big crunch metaheuristic to large-sized operational problems." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 3 (June 1, 2020): 2484. http://dx.doi.org/10.11591/ijece.v10i3.pp2484-2502.
Повний текст джерелаLI, JIANGE, and MOKSHAY MADIMAN. "A Combinatorial Approach to Small Ball Inequalities for Sums and Differences." Combinatorics, Probability and Computing 28, no. 1 (November 6, 2018): 100–129. http://dx.doi.org/10.1017/s0963548318000494.
Повний текст джерелаZeng, Guo-Qiang, Kang-Di Lu, Jie Chen, Zheng-Jiang Zhang, Yu-Xing Dai, Wen-Wen Peng, and Chong-Wei Zheng. "An Improved Real-Coded Population-Based Extremal Optimization Method for Continuous Unconstrained Optimization Problems." Mathematical Problems in Engineering 2014 (2014): 1–9. http://dx.doi.org/10.1155/2014/420652.
Повний текст джерелаRüschendorf, Ludger. "On stochastic recursive equations of sum and max type." Journal of Applied Probability 43, no. 03 (September 2006): 687–703. http://dx.doi.org/10.1017/s0021900200002035.
Повний текст джерелаChen, Szu-Chou, Wen-Chen Huang, Ming-Hsien Hsueh, Chieh-Yu Pan, and Chih-Hao Chang. "A Novel Exponential-Weighted Method of the Antlion Optimization Algorithm for Improving the Convergence Rate." Processes 10, no. 7 (July 20, 2022): 1413. http://dx.doi.org/10.3390/pr10071413.
Повний текст джерелаRüschendorf, Ludger. "On stochastic recursive equations of sum and max type." Journal of Applied Probability 43, no. 3 (September 2006): 687–703. http://dx.doi.org/10.1239/jap/1158784939.
Повний текст джерелаBansal, Sulabh, and C. Patvardhan. "A Generalized Parallel Quantum Inspired Evolutionary Algorithm Framework for Hard Subset Selection Problems." International Journal of Applied Evolutionary Computation 10, no. 4 (October 2019): 1–38. http://dx.doi.org/10.4018/ijaec.2019100101.
Повний текст джерелаDavid, Benjamin M., Ryan M. Wyllie, Ramdane Harouaka, and Paul A. Jensen. "A reinforcement learning framework for pooled oligonucleotide design." Bioinformatics 38, no. 8 (February 10, 2022): 2219–25. http://dx.doi.org/10.1093/bioinformatics/btac073.
Повний текст джерелаEmerick, Brooks, Yun Lu, and Francis J. Vasko. "Using machine learning to predict the number of alternative solutions to a minimum cardinality set covering problem." International Journal of Industrial Optimization 2, no. 1 (February 24, 2021): 1. http://dx.doi.org/10.12928/ijio.v2i1.2948.
Повний текст джерелаBolaji, Asaju La’aro, Ahamad Tajudin Khader, Mohammed Azmi Al-Betar, and Mohammed A. Awadallah. "A Hybrid Nature-Inspired Artificial Bee Colony Algorithm for Uncapacitated Examination Timetabling Problems." Journal of Intelligent Systems 24, no. 1 (March 1, 2015): 37–54. http://dx.doi.org/10.1515/jisys-2014-0002.
Повний текст джерелаCao, Yan, Sen Cao, Lei Lei, Yu Bai, and Lei Shi. "System Development of a Simulated Annealing Algorithm for Job-Shop Scheduling Problem Based on Delphi." Advanced Materials Research 411 (November 2011): 411–14. http://dx.doi.org/10.4028/www.scientific.net/amr.411.411.
Повний текст джерелаEsra'a Alkafaween and Ahmad B. A. Hassanat. "Improving TSP Solutions Using GA with a New Hybrid Mutation Based on Knowledge and Randomness." Communications - Scientific letters of the University of Zilina 22, no. 3 (July 8, 2020): 128–39. http://dx.doi.org/10.26552/com.c.2020.3.128-139.
Повний текст джерелаYu, Miao, Viswanath Nagarajan, and Siqian Shen. "Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization." INFORMS Journal on Computing 34, no. 2 (March 2022): 953–73. http://dx.doi.org/10.1287/ijoc.2021.1105.
Повний текст джерелаPshenichnykh, А. O., and E. I. Vatutin. "Analysis of the Results of Applying the Bee Colony Method in the Problem of Coloring General Graphs." Proceedings of the Southwest State University 24, no. 4 (February 4, 2021): 126–45. http://dx.doi.org/10.21869/2223-1560-2020-24-4-126-145.
Повний текст джерелаAlbers, Susanne, Arindam Khan, and Leon Ladewig. "Improved Online Algorithms for Knapsack and GAP in the Random Order Model." Algorithmica 83, no. 6 (February 17, 2021): 1750–85. http://dx.doi.org/10.1007/s00453-021-00801-2.
Повний текст джерелаBarbosa, Valmir C. "The Conduciveness of CA-Rule Graphs." Artificial Life 19, no. 2 (April 2013): 255–66. http://dx.doi.org/10.1162/artl_a_00107.
Повний текст джерелаAlyahya, Khulood, and Jonathan E. Rowe. "Landscape Analysis of a Class of NP-Hard Binary Packing Problems." Evolutionary Computation 27, no. 1 (March 2019): 47–73. http://dx.doi.org/10.1162/evco_a_00237.
Повний текст джерелаPhuong, Nguyen D., Pham Thang, and Le A. Vinh. "Incidences between points and generalized spheres over finite fields and related problems." Forum Mathematicum 29, no. 2 (March 1, 2017): 449–56. http://dx.doi.org/10.1515/forum-2015-0024.
Повний текст джерелаGRYGIEL, KATARZYNA, and PIERRE LESCANNE. "Counting and generating lambda terms." Journal of Functional Programming 23, no. 5 (September 2013): 594–628. http://dx.doi.org/10.1017/s0956796813000178.
Повний текст джерелаCárdenas-Montes, Miguel. "Slope-to-optimal-solution-based evaluation of the hardness of travelling salesman problem instances." Logic Journal of the IGPL 28, no. 1 (January 20, 2020): 45–57. http://dx.doi.org/10.1093/jigpal/jzz070.
Повний текст джерелаFukunaga, A. S., and R. E. Korf. "Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems." Journal of Artificial Intelligence Research 28 (March 30, 2007): 393–429. http://dx.doi.org/10.1613/jair.2106.
Повний текст джерелаMisawa, Naoko, Kenta Taoka, Chihiro Matsui, and Ken Takeuchi. "97.6% array area reduction, ReRAM computation-in-memory with hyperparameter optimization based on memory bit-error rate and bit precision of log-encoding simulated annealing." Japanese Journal of Applied Physics 61, SC (February 8, 2022): SC1001. http://dx.doi.org/10.35848/1347-4065/ac356f.
Повний текст джерелаSinclair, Alistair. "Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow." Combinatorics, Probability and Computing 1, no. 4 (December 1992): 351–70. http://dx.doi.org/10.1017/s0963548300000390.
Повний текст джерела