Artículos de revistas sobre el tema "Random combinatorial problems"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Random combinatorial problems".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Coja-Oghlan, Amin, Tobias Kapetanopoulos y Noela Müller. "The replica symmetric phase of random constraint satisfaction problems". Combinatorics, Probability and Computing 29, n.º 3 (3 de diciembre de 2019): 346–422. http://dx.doi.org/10.1017/s0963548319000440.
Texto completoSerafini, Paolo. "Combinatorial optimization problems with normal random costs". Operations Research Letters 41, n.º 2 (marzo de 2013): 126–33. http://dx.doi.org/10.1016/j.orl.2012.11.014.
Texto completoGalbiati, G. y F. Maffioli. "Random pseudo-polynomial algorithms for some combinatorial programming problems". European Journal of Operational Research 58, n.º 2 (abril de 1992): 223–35. http://dx.doi.org/10.1016/0377-2217(92)90209-r.
Texto completoLeone, Michele, Federico Ricci-Tersenghi y Riccardo Zecchina. "Phase coexistence and finite-size scaling in random combinatorial problems". Journal of Physics A: Mathematical and General 34, n.º 22 (24 de mayo de 2001): 4615–26. http://dx.doi.org/10.1088/0305-4470/34/22/303.
Texto completoReznik, A. L., A. A. Soloviev y A. V. Torgov. "Programs of Recursive Analytical Calculations in Problems of Random Point Images Analysis". Izvestiya of Altai State University, n.º 4(114) (9 de septiembre de 2020): 112–16. http://dx.doi.org/10.14258/izvasu(2020)4-18.
Texto completoKuchinskii, É. Z. y M. V. Sadovskii. "Combinatorial analysis of Feynman diagrams in problems with a Gaussian random field". Journal of Experimental and Theoretical Physics 86, n.º 2 (febrero de 1998): 367–74. http://dx.doi.org/10.1134/1.558437.
Texto completoLiu, Yucheng y Zhichao Wang. "Some Generalizations of Random Broken and Pick-up Stick Problems". Journal of Physics: Conference Series 2287, n.º 1 (1 de junio de 2022): 012003. http://dx.doi.org/10.1088/1742-6596/2287/1/012003.
Texto completoBouhmala, Noureddine y Ole-Christoffer Granmo. "Stochastic Learning for SAT- Encoded Graph Coloring Problems". International Journal of Applied Metaheuristic Computing 1, n.º 3 (julio de 2010): 1–19. http://dx.doi.org/10.4018/jamc.2010070101.
Texto completoKNIZHNIK, V. G., A. M. POLYAKOV y A. B. ZAMOLODCHIKOV. "FRACTAL STRUCTURE OF 2d—QUANTUM GRAVITY". Modern Physics Letters A 03, n.º 08 (julio de 1988): 819–26. http://dx.doi.org/10.1142/s0217732388000982.
Texto completoReznik, A. L., A. A. Solov’ev y A. V. Torgov. "Program-combinatorial approach to solving problems of error-free readout of random point images". Optoelectronics, Instrumentation and Data Processing 52, n.º 2 (marzo de 2016): 121–27. http://dx.doi.org/10.3103/s8756699016020035.
Texto completoBarrett, Thomas, William Clements, Jakob Foerster y Alex Lvovsky. "Exploratory Combinatorial Optimization with Reinforcement Learning". Proceedings of the AAAI Conference on Artificial Intelligence 34, n.º 04 (3 de abril de 2020): 3243–50. http://dx.doi.org/10.1609/aaai.v34i04.5723.
Texto completoAmaro, David, Carlo Modica, Matthias Rosenkranz, Mattia Fiorentini, Marcello Benedetti y Michael Lubasch. "Filtering variational quantum algorithms for combinatorial optimization". Quantum Science and Technology 7, n.º 1 (1 de enero de 2022): 015021. http://dx.doi.org/10.1088/2058-9565/ac3e54.
Texto completoEl Majdoubi, Omayma, Farah Abdoun y 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.
Texto completoGehring, Wolfgang, Peter Salamon, Roger E. Whitney y Paolo Sibani. "Correlation Structure of Landscapes of NP-Complete Optimization Problems at Finite Temperatures". Open Systems & Information Dynamics 11, n.º 02 (junio de 2004): 177–84. http://dx.doi.org/10.1023/b:opsy.0000034195.19292.a0.
Texto completoZhou, Guangyan y Rui Kang. "On the Lower Bounds of (1,0)-Super Solutions for Random k-SAT". International Journal of Foundations of Computer Science 30, n.º 02 (febrero de 2019): 247–54. http://dx.doi.org/10.1142/s0129054119500035.
Texto completoBelozerov, Ilya Andreevich y Vladimir Anatolievich Sudakov. "Reinforcement Machine Learning for Solving Mathematical Programming Problems". Keldysh Institute Preprints, n.º 36 (2022): 1–14. http://dx.doi.org/10.20948/prepr-2022-36.
Texto completoEgger, Daniel J., Jakub Mareček y Stefan Woerner. "Warm-starting quantum optimization". Quantum 5 (17 de junio de 2021): 479. http://dx.doi.org/10.22331/q-2021-06-17-479.
Texto completoCrane, Harry y Walter Dempsey. "Relational exchangeability". Journal of Applied Probability 56, n.º 01 (marzo de 2019): 192–208. http://dx.doi.org/10.1017/jpr.2019.13.
Texto completoSrinivasan, Sriram, Behrouz Babaki, Golnoosh Farnadi y Lise Getoor. "Lifted Hinge-Loss Markov Random Fields". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julio de 2019): 7975–83. http://dx.doi.org/10.1609/aaai.v33i01.33017975.
Texto completoChilds, A. M., E. Farhi, J. Goldstone y S. Gutmann. "Finding cliques by quantum adiabatic evolution". Quantum Information and Computation 2, n.º 3 (abril de 2002): 181–91. http://dx.doi.org/10.26421/qic2.3-1.
Texto completoDu, Yihan, Yuko Kuroki y Wei Chen. "Combinatorial Pure Exploration with Full-Bandit or Partial Linear Feedback". Proceedings of the AAAI Conference on Artificial Intelligence 35, n.º 8 (18 de mayo de 2021): 7262–70. http://dx.doi.org/10.1609/aaai.v35i8.16892.
Texto completoSezer, Ali Devin y Ferruh Özbudak. "Approximation of bounds on mixed-level orthogonal arrays". Advances in Applied Probability 43, n.º 2 (junio de 2011): 399–421. http://dx.doi.org/10.1239/aap/1308662485.
Texto completoSezer, Ali Devin y Ferruh Özbudak. "Approximation of bounds on mixed-level orthogonal arrays". Advances in Applied Probability 43, n.º 02 (junio de 2011): 399–421. http://dx.doi.org/10.1017/s0001867800004912.
Texto completoKarlin, Samuel. "Coincident probabilities and applications in combinatorics". Journal of Applied Probability 25, A (1988): 185–200. http://dx.doi.org/10.2307/3214156.
Texto completoKarlin, Samuel. "Coincident probabilities and applications in combinatorics". Journal of Applied Probability 25, A (1988): 185–200. http://dx.doi.org/10.1017/s0021900200040353.
Texto completoZhang, W. "Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem". Journal of Artificial Intelligence Research 21 (1 de abril de 2004): 471–97. http://dx.doi.org/10.1613/jair.1389.
Texto completoGarcía, José, Paola Moraga, Matias Valenzuela, Broderick Crawford, Ricardo Soto, Hernan Pinto, Alvaro Peña, Francisco Altimiras y Gino Astorga. "A Db-Scan Binarization Algorithm Applied to Matrix Covering Problems". Computational Intelligence and Neuroscience 2019 (16 de septiembre de 2019): 1–16. http://dx.doi.org/10.1155/2019/3238574.
Texto completoQawqzeh, Yousef K., Ghaith Jaradat, Ali Al-Yousef, Anmar Abu-Hamdah, Ibrahim Almarashdeh, Mutasem Alsmadi, Mohammed Tayfour, Khalid Shaker y Firas Haddad. "Applying the big bang-big crunch metaheuristic to large-sized operational problems". International Journal of Electrical and Computer Engineering (IJECE) 10, n.º 3 (1 de junio de 2020): 2484. http://dx.doi.org/10.11591/ijece.v10i3.pp2484-2502.
Texto completoLI, JIANGE y MOKSHAY MADIMAN. "A Combinatorial Approach to Small Ball Inequalities for Sums and Differences". Combinatorics, Probability and Computing 28, n.º 1 (6 de noviembre de 2018): 100–129. http://dx.doi.org/10.1017/s0963548318000494.
Texto completoZeng, Guo-Qiang, Kang-Di Lu, Jie Chen, Zheng-Jiang Zhang, Yu-Xing Dai, Wen-Wen Peng y 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.
Texto completoRüschendorf, Ludger. "On stochastic recursive equations of sum and max type". Journal of Applied Probability 43, n.º 03 (septiembre de 2006): 687–703. http://dx.doi.org/10.1017/s0021900200002035.
Texto completoChen, Szu-Chou, Wen-Chen Huang, Ming-Hsien Hsueh, Chieh-Yu Pan y Chih-Hao Chang. "A Novel Exponential-Weighted Method of the Antlion Optimization Algorithm for Improving the Convergence Rate". Processes 10, n.º 7 (20 de julio de 2022): 1413. http://dx.doi.org/10.3390/pr10071413.
Texto completoRüschendorf, Ludger. "On stochastic recursive equations of sum and max type". Journal of Applied Probability 43, n.º 3 (septiembre de 2006): 687–703. http://dx.doi.org/10.1239/jap/1158784939.
Texto completoBansal, Sulabh y C. Patvardhan. "A Generalized Parallel Quantum Inspired Evolutionary Algorithm Framework for Hard Subset Selection Problems". International Journal of Applied Evolutionary Computation 10, n.º 4 (octubre de 2019): 1–38. http://dx.doi.org/10.4018/ijaec.2019100101.
Texto completoDavid, Benjamin M., Ryan M. Wyllie, Ramdane Harouaka y Paul A. Jensen. "A reinforcement learning framework for pooled oligonucleotide design". Bioinformatics 38, n.º 8 (10 de febrero de 2022): 2219–25. http://dx.doi.org/10.1093/bioinformatics/btac073.
Texto completoEmerick, Brooks, Yun Lu y 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, n.º 1 (24 de febrero de 2021): 1. http://dx.doi.org/10.12928/ijio.v2i1.2948.
Texto completoBolaji, Asaju La’aro, Ahamad Tajudin Khader, Mohammed Azmi Al-Betar y Mohammed A. Awadallah. "A Hybrid Nature-Inspired Artificial Bee Colony Algorithm for Uncapacitated Examination Timetabling Problems". Journal of Intelligent Systems 24, n.º 1 (1 de marzo de 2015): 37–54. http://dx.doi.org/10.1515/jisys-2014-0002.
Texto completoCao, Yan, Sen Cao, Lei Lei, Yu Bai y Lei Shi. "System Development of a Simulated Annealing Algorithm for Job-Shop Scheduling Problem Based on Delphi". Advanced Materials Research 411 (noviembre de 2011): 411–14. http://dx.doi.org/10.4028/www.scientific.net/amr.411.411.
Texto completoEsra'a Alkafaween y 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, n.º 3 (8 de julio de 2020): 128–39. http://dx.doi.org/10.26552/com.c.2020.3.128-139.
Texto completoYu, Miao, Viswanath Nagarajan y Siqian Shen. "Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization". INFORMS Journal on Computing 34, n.º 2 (marzo de 2022): 953–73. http://dx.doi.org/10.1287/ijoc.2021.1105.
Texto completoPshenichnykh, А. O. y 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, n.º 4 (4 de febrero de 2021): 126–45. http://dx.doi.org/10.21869/2223-1560-2020-24-4-126-145.
Texto completoAlbers, Susanne, Arindam Khan y Leon Ladewig. "Improved Online Algorithms for Knapsack and GAP in the Random Order Model". Algorithmica 83, n.º 6 (17 de febrero de 2021): 1750–85. http://dx.doi.org/10.1007/s00453-021-00801-2.
Texto completoBarbosa, Valmir C. "The Conduciveness of CA-Rule Graphs". Artificial Life 19, n.º 2 (abril de 2013): 255–66. http://dx.doi.org/10.1162/artl_a_00107.
Texto completoAlyahya, Khulood y Jonathan E. Rowe. "Landscape Analysis of a Class of NP-Hard Binary Packing Problems". Evolutionary Computation 27, n.º 1 (marzo de 2019): 47–73. http://dx.doi.org/10.1162/evco_a_00237.
Texto completoPhuong, Nguyen D., Pham Thang y Le A. Vinh. "Incidences between points and generalized spheres over finite fields and related problems". Forum Mathematicum 29, n.º 2 (1 de marzo de 2017): 449–56. http://dx.doi.org/10.1515/forum-2015-0024.
Texto completoGRYGIEL, KATARZYNA y PIERRE LESCANNE. "Counting and generating lambda terms". Journal of Functional Programming 23, n.º 5 (septiembre de 2013): 594–628. http://dx.doi.org/10.1017/s0956796813000178.
Texto completoCárdenas-Montes, Miguel. "Slope-to-optimal-solution-based evaluation of the hardness of travelling salesman problem instances". Logic Journal of the IGPL 28, n.º 1 (20 de enero de 2020): 45–57. http://dx.doi.org/10.1093/jigpal/jzz070.
Texto completoFukunaga, A. S. y R. E. Korf. "Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems". Journal of Artificial Intelligence Research 28 (30 de marzo de 2007): 393–429. http://dx.doi.org/10.1613/jair.2106.
Texto completoMisawa, Naoko, Kenta Taoka, Chihiro Matsui y 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 (8 de febrero de 2022): SC1001. http://dx.doi.org/10.35848/1347-4065/ac356f.
Texto completoSinclair, Alistair. "Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow". Combinatorics, Probability and Computing 1, n.º 4 (diciembre de 1992): 351–70. http://dx.doi.org/10.1017/s0963548300000390.
Texto completo