Literatura académica sobre el tema "Random combinatorial problems"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas 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.
Artículos de revistas sobre el tema "Random combinatorial problems"
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 completoTesis sobre el tema "Random combinatorial problems"
Meehan, Sean. "On Some Universality Problems in Combinatorial Random Matrix Theory". The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1563381611232149.
Texto completoMALATESTA, ENRICO MARIA. "RANDOM COMBINATORIAL OPTIMIZATION PROBLEMS: MEAN FIELD AND FINITE-DIMENSIONAL RESULTS". Doctoral thesis, Università degli Studi di Milano, 2018. http://hdl.handle.net/2434/605056.
Texto completoNoel, Jonathan A. "Extremal combinatorics, graph limits and computational complexity". Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:8743ff27-b5e9-403a-a52a-3d6299792c7b.
Texto completoBuckley, Stephen Philip. "Problems in random walks in random environments". Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:06a12be2-b831-4c2a-87b1-f0abccfb9b8b.
Texto completoPerson, Yury. "Quasi-random hypergraphs and extremal problems for hypergraphs". Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2010. http://dx.doi.org/10.18452/16238.
Texto completoThis thesis presents first one possible generalization of the result of Chung, Graham and Wilson to k-uniform hypergraphs, and studies the so-called weak quasi-randomness. As applications we obtain a simple strong refutation algorithm for random sparse k-SAT formulas and we identify first non-bipartite forcing pairs for quasi-random graphs. Our focus then shifts from the study of quasi-random objects to applications of different versions of the hypergraph regularity lemmas; all these versions assert decompositions of hypergraphs into constantly many quasi-random parts, where the meaning of ``quasi-random'''' takes different contexts in different situations. We study the family of hypergraphs not containing the hypergraph of the Fano plane as a subhypergraph, and show that almost all members of this family are bipartite. As a consequence an algorithm for coloring bipartite 3-uniform hypergraphs with average polynomial running time is given. Then the following combinatorial extremal problem is considered. Suppose one is given r colors and a fixed hypergraph F. The question is: In at most how many ways can one color the hyperedges of a hypergraph H on n vertices such that no monochromatic copy of F is created? What are the extremal hypergraphs for this function? Here a structural result for a natural family of hypergraphs F is proven. For some special classes of hypergraphs we show that their extremal hypergraphs (for large n) maximize the number of edge colorings for 2 and 3 colors, while for at least 4 colors other hypergraphs are optimal.
Creed, Patrick John. "Counting and sampling problems on Eulerian graphs". Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4759.
Texto completoCoregliano, Leonardo Nagami. "Flag algebras and tournaments". Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-12082015-093248/.
Texto completoAlexander A. Razborov (2007) desenvolveu a teoria de álgebras de flags para calcular a densidade assintótica mínima de triângulos em um grafo em função de sua densidade de arestas. A teoria das álgebras de flags, contudo, pode ser usada para estudar densidades assintóticas de diversos objetos combinatórios. Nesta dissertação, apresentamos dois resultados originais obtidos na teoria de torneios através de técnicas de demonstração de álgebras de flags. O primeiro resultado compreende a minimização da densidade assintótica de torneios transitivos em uma sequência de torneios, a qual provamos ocorrer se e somente se a sequência é quase aleatória. Como subprodutos, obtemos também novas caracterizações de quase aleatoriedade e diversos outros elementos da álgebra de flags cuja densidade é minimizada se e somente se a sequência é quase aleatória. O segundo resultado compreende uma classe de propriedades equivalentes sobre uma sequência de torneios que chamamos de propriedades quase carrossel e que, de uma forma similar às propriedades quase aleatórias, forçam que a sequência convirja para um homomorfismo limite específico. Várias propriedades quase carrossel, quando comparadas às propriedades quase aleatórias, sugerem que sequências quase aleatórias e sequências quase carrossel estão o mais distantes possível umas das outras na classe de sequências quase balanceadas.
Law, Hiu-Fai. "Trees and graphs : congestion, polynomials and reconstruction". Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c5.
Texto completoDemopoulos, Demetrios D. "Probabilistic phenomena in random combinatorial problems". Thesis, 2003. http://hdl.handle.net/1911/17587.
Texto completoTheran, Louis Simon. "Problems in Generic Combinatorial Rigidity: Sparsity, Sliders, and Emergence of Components". 2010. https://scholarworks.umass.edu/open_access_dissertations/316.
Texto completoLibros sobre el tema "Random combinatorial problems"
Yukich, Joseph. Probability theory of classical Euclidean optimization problems. Berlin: Springer, 1998.
Buscar texto completoChandra, Chekuri y International Workshop on Randomization and Computation (9th : 2005 : Berkeley, Calif.), eds. Approximation, randomization, and combinatorial optimization: Algorithms and techniques : 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, and 9th International Workshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005 : proceedings. Berlin: Springer, 2005.
Buscar texto completo1950-, Díaz J. y International Workshop on Randomization and Computation (10th : 2006 : Barcelona, Spain), eds. Approximation, randomization and combinatorial optimization: Algorithms and techniques : 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006, and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30, 2006 : proceedings. Berlin: Springer, 2006.
Buscar texto completoSpencer, Joel H. Asymptopia. Providence, Rhode Island: American Mathematical Society, 2014.
Buscar texto completoInternational Workshop on Approximation Algorithms for Combinatorial Optimization Problems (7th 2004 Cambridge, Mass.). Approximation, randomization, and combinatorial optimization : algorithms and techniques: 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004 : proceedings. Berlin: Springer, 2004.
Buscar texto completoInternational Workshop on Randomization and Approximation Techniques in Computer Science (3rd 1999 Berkeley, Calif.). Randomization, approximation, and combinatorial optimization: Algorithms and techniques : Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX '99, Berkeley, CA, August 8-11, 1999, proceedings. Berlin: Springer, 1999.
Buscar texto completoSanjeev, Arora y International Workshop on Randomization and Approximation Techniques in Computer Science (7th : 2003 : Princeton, N.J.), eds. Approximation, randomization, and combinatorial optimization: Algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings. Berlin: Springer, 2003.
Buscar texto completoMichel, Goemans y International Workshop on Randomization and Approximation Techniques in Computer Science (5th : 2001 : Berkeley, Calif.), eds. Approximation, randomization, and combinatorial optimization: Algorithms and techniques : 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001, Berkeley, CA, USA, August 18-20, 2001, proceedings. New York: Springer, 2001.
Buscar texto completoPaliy, Irina. Probability theory and mathematical statistics. ru: INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1065828.
Texto completoPaliy, Irina, V. A. Dalinger y B. S. Dobronec. Probability theory and mathematical statistics. ru: INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/1859126.
Texto completoCapítulos de libros sobre el tema "Random combinatorial problems"
Shen, Yilin, Xiang Li y My T. Thai. "Approximation Algorithms for Optimization Problems in Random Power-Law Graphs". En Combinatorial Optimization and Applications, 343–55. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12691-3_26.
Texto completoWelsh, Dominic. "Percolation and the Random Cluster Model: Combinatorial and Algorithmic Problems". En Algorithms and Combinatorics, 166–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/978-3-662-12788-9_5.
Texto completoStamatatos, Efstathios y Kostas Stergiou. "Learning How to Propagate Using Random Probing". En Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 263–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01929-6_20.
Texto completoPferschy, Ulrich. "The random linear bottleneck assignment problem". En Integer Programming and Combinatorial Optimization, 145–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-59408-6_48.
Texto completoBierwirth, Christian, Dirk Christian Mattfeld y Jean-Paul Watson. "Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem". En Evolutionary Computation in Combinatorial Optimization, 21–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24652-7_3.
Texto completoHeilig, Leonard, Eduardo Lalla-Ruiz y Stefan Voß. "A Biased Random-Key Genetic Algorithm for the Cloud Resource Management Problem". En Evolutionary Computation in Combinatorial Optimization, 1–12. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-16468-7_1.
Texto completoFrieze, Alan y Michael Molloy. "The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems". En Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques, 275–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45198-3_24.
Texto completoBaltz, Andreas, Tomasz Schoen y Anand Srivastav. "On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation". En Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 192–201. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44666-4_22.
Texto completoGuionnet, Alice. "Heavy Tailed Random Matrices: How They Differ from the GOE, and Open Problems". En Computation and Combinatorics in Dynamics, Stochastics and Control, 415–27. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01593-0_15.
Texto completoBassino, Frédérique, Tsinjo Rakotoarimalala y Andrea Sportiello. "The complexity of the Multiple Pattern Matching Problem for random strings". En 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 40–53. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2018. http://dx.doi.org/10.1137/1.9781611975062.5.
Texto completoActas de conferencias sobre el tema "Random combinatorial problems"
De Moraes, Matheus Bernardelli y Guilherme Palermo Coelho. "A Random Forest-Assisted Decomposition-Based Evolutionary Algorithm for Multi-Objective Combinatorial Optimization Problems". En 2022 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2022. http://dx.doi.org/10.1109/cec55065.2022.9870412.
Texto completoHemmi, David. "Stochastic Constraint Programming". En Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/751.
Texto completoYokoyama, Soichiro, Ikuo Suzuki, Masahito Yamamoto y Masashi Furukawa. "A New Heuristic for Traveling Salesman Problem Based on LCO". En ASME/ISCIE 2012 International Symposium on Flexible Automation. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/isfa2012-7227.
Texto completoLi, Chu-Min, Zhenxing Xu, Jordi Coll, Felip Manyà, Djamal Habet y Kun He. "Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract)". En Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/739.
Texto completoIshihata, Masakazu y Takanori Maehara. "Exact Bernoulli Scan Statistics using Binary Decision Diagrams". En Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/795.
Texto completoFujita, Kikuo, Shinsuke Akagi, Kiyotaka Yoshida y Noriyasu Hirokawa. "Genetic Algorithm Based Optimal Planning Method of Energy Plant Configurations". En ASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference. American Society of Mechanical Engineers, 1996. http://dx.doi.org/10.1115/96-detc/dac-1464.
Texto completoCai, Shaowei, Wenying Hou, Jinkun Lin y Yuanjie Li. "Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies". En Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/196.
Texto completoRakotoarison, Herilalaina, Marc Schoenauer y Michèle Sebag. "Automated Machine Learning with Monte-Carlo Tree Search". En Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/457.
Texto completoBuermann, Jan y Jie Zhang. "Multi-Robot Adversarial Patrolling Strategies via Lattice Paths". En Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/582.
Texto completoPucheta, Martín A., Nicolás E. Ulrich y Alberto Cardona. "Combined Graph Layout Algorithms for Automated Sketching of Kinematic Chains". En ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70665.
Texto completoInformes sobre el tema "Random combinatorial problems"
Denley, Tristan, Talmage J. Reid y Haidong Wu. Applications of Random Methods in Combinatories and Scheduling Problems. Fort Belvoir, VA: Defense Technical Information Center, diciembre de 2002. http://dx.doi.org/10.21236/ada408961.
Texto completo