Literatura académica sobre el tema "Combinatorial statistics"
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 "Combinatorial statistics".
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 "Combinatorial statistics"
Gerards, A. M. H. y A. W. J. Kolen. "Polyhedral Combinatorics in Combinatorial Optimization". Statistica Neerlandica 41, n.º 1 (marzo de 1987): 1–25. http://dx.doi.org/10.1111/j.1467-9574.1987.tb01168.x.
Texto completoNiven, R. K. "Combinatorial entropies and statistics". European Physical Journal B 70, n.º 1 (16 de mayo de 2009): 49–63. http://dx.doi.org/10.1140/epjb/e2009-00168-5.
Texto completoHansen, J. C. "Order statistics for random combinatorial structures". Advances in Applied Probability 24, n.º 4 (diciembre de 1992): 774. http://dx.doi.org/10.1017/s0001867800024836.
Texto completoDenise, Alain y Rodica Simion. "Two combinatorial statistics on Dyck paths". Discrete Mathematics 137, n.º 1-3 (enero de 1995): 155–76. http://dx.doi.org/10.1016/0012-365x(93)e0147-v.
Texto completoSimion, Rodica. "Combinatorial statistics on non-crossing partitions". Journal of Combinatorial Theory, Series A 66, n.º 2 (mayo de 1994): 270–301. http://dx.doi.org/10.1016/0097-3165(94)90066-3.
Texto completoHansen, Jennie C. "Order statistics for decomposable combinatorial structures". Random Structures & Algorithms 5, n.º 4 (octubre de 1994): 517–33. http://dx.doi.org/10.1002/rsa.3240050404.
Texto completoCalvin, James A. y Marshall Hall. "Combinatorial Theory." Journal of the American Statistical Association 82, n.º 400 (diciembre de 1987): 1197. http://dx.doi.org/10.2307/2289431.
Texto completoBernabei, Maria Simonetta y Horst Thaler. "Central Limit Theorem for Coloured Hard Dimers". Journal of Probability and Statistics 2010 (2010): 1–13. http://dx.doi.org/10.1155/2010/781681.
Texto completoSCHORK, MATTHIAS. "SOME ALGEBRAICAL, COMBINATORIAL AND ANALYTICAL PROPERTIES OF PARAGRASSMANN VARIABLES". International Journal of Modern Physics A 20, n.º 20n21 (20 de agosto de 2005): 4797–819. http://dx.doi.org/10.1142/s0217751x05025127.
Texto completoCrane, Harry. "Combinatorial Lévy processes". Annals of Applied Probability 28, n.º 1 (febrero de 2018): 285–339. http://dx.doi.org/10.1214/17-aap1306.
Texto completoTesis sobre el tema "Combinatorial statistics"
Ning, Michael Zhu. "Relational combinatorial optimisation". Thesis, University of Oxford, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.284507.
Texto completoOlsen, McCabe J. "HILBERT BASES, DESCENT STATISTICS, AND COMBINATORIAL SEMIGROUP ALGEBRAS". UKnowledge, 2018. https://uknowledge.uky.edu/math_etds/52.
Texto completoQuinn, Kathleen Anne Sara. "Combinatorial structures with applications to information theory". Thesis, Royal Holloway, University of London, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.261791.
Texto completoMarett, Richard Colin. "Neighbourhood search techniques for multi-objective combinatorial problems". Thesis, Lancaster University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296889.
Texto completoMcShine, Lisa Maria. "Random sampling of combinatorial structures". Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/28771.
Texto completoWilliams, Trevor K. "Combinatorial Games on Graphs". DigitalCommons@USU, 2017. https://digitalcommons.usu.edu/etd/6502.
Texto completoNiese, Elizabeth M. "Combinatorial Properties of the Hilbert Series of Macdonald Polynomials". Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/26702.
Texto completoPh. D.
Hites, Romina. "Robustness and preferences in combinatorial optimization". Doctoral thesis, Universite Libre de Bruxelles, 2005. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210905.
Texto completoTherefore, in each of these new measures, a second criteria is used to evaluate the performance of the solution in other scenarios such as the best case one.
We also study the robust deviation p-elements problem. In fact, we study when this solution is equal to the optimal solution in the scenario where the cost of each element is the midpoint of its corresponding interval.
Then, we finally formulate the robust combinatorial problem with interval data as a bicriteria problem. We also integrate the decision maker's preferences over certain types of solutions into the model. We propose a method that uses these preferences to find the set of solutions that are never preferred by any other solution. We call this set the final set.
We study the properties of the final sets from a coherence point of view and from a robust point of view. From a coherence point of view, we study necessary and sufficient conditions for the final set to be monotonic, for the corresponding preferences to be without cycles, and for the set to be stable.
Those that do not satisfy these properties are eliminated since we believe these properties to be essential. We also study other properties such as the transitivity of the preference and indifference relations and more. We note that many of our final sets are included in one another and some are even intersections of other final sets. From a robust point of view, we compare our final sets with different measures of robustness and with the first- and second-degree stochastic dominance. We show which sets contain all of these solutions and which only contain these types of solutions. Therefore, when the decision maker chooses his preferences to find the final set, he knows what types of solutions may or may not be in the set.
Lastly, we implement this method and apply it to the Robust Shortest Path Problem. We look at how this method performs using different types of randomly generated instances.
Doctorat en sciences, Orientation recherche opérationnelle
info:eu-repo/semantics/nonPublished
Talebi, Mazraeh Shahi Mohammad Sadegh. "Minimizing Regret in Combinatorial Bandits and Reinforcement Learning". Doctoral thesis, KTH, Reglerteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-219970.
Texto completoQC 20171215
Devlin, Agatha. "A study of parallel algorithms for the solution of some combinatorial optimization problems on a distributed array of processors". Thesis, Queen's University Belfast, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282129.
Texto completoLibros sobre el tema "Combinatorial statistics"
Roux, Brigitte Le. Combinatorial Inference in Geometric Data Analysis. Boca Raton, Florida, USA: Chapman and Hall/CRC, Taylor & Francis Group, 2019.
Buscar texto completoHubert, Lawrence J. Assignment methods in combinatorial data analysis. New York: M. Dekker, 1987.
Buscar texto completo1956-, Balakrishnan N., ed. Advances in combinatorial methods and applications to probability and statistics. Boston: Birkhäuser, 1997.
Buscar texto completoBalakrishnan, N., ed. Advances in Combinatorial Methods and Applications to Probability and Statistics. Boston, MA: Birkhäuser Boston, 1996. http://dx.doi.org/10.1007/978-1-4612-4140-9.
Texto completoL, Aarts E. H. y Lenstra J. K, eds. Local search in combinatorial optimization. Chichester [England]: Wiley, 1997.
Buscar texto completoBapat, Ravindra B. Combinatorial Matrix Theory and Generalized Inverses of Matrices. India: Springer India, 2013.
Buscar texto completoMartin, George E. Counting: The Art of Enumerative Combinatorics. New York, NY: Springer New York, 2001.
Buscar texto completoWright, Tommy. Exact confidence bounds when sampling from small finite universes: An easy reference based on the hypergeometric distribution. Berlin: Springer-Verlag, 1991.
Buscar texto completoBarthélemy, Jean-Pierre. Trees and proximity representations. Chichester: Wiley, 1991.
Buscar texto completoIonin, Yuri. Combinatorics of symmetric designs. Cambridge, UK: Cambridge University Press, 2006.
Buscar texto completoCapítulos de libros sobre el tema "Combinatorial statistics"
Marshall, Albert W., Ingram Olkin y Barry C. Arnold. "Combinatorial Analysis". En Springer Series in Statistics, 243–67. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-0-387-68276-1_7.
Texto completoLange, Kenneth. "Combinatorial Optimization". En Springer Texts in Statistics, 103–22. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-1-4419-7165-4_5.
Texto completoSzpankowski, Wojciech. "Combinatorial optimization through order statistics". En Lecture Notes in Computer Science, 208–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54945-5_64.
Texto completoWen, Zhenzao, Jiapeng Huang, Linghe Kong, Min-You Wu y Guihai Chen. "Classification Statistics in RFID Systems". En Combinatorial Optimization and Applications, 425–40. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71147-8_29.
Texto completoRubinstein, Reuven Y. y Dirk P. Kroese. "Combinatorial Optimization via Cross-Entropy". En Information Science and Statistics, 129–86. New York, NY: Springer New York, 2004. http://dx.doi.org/10.1007/978-1-4757-4321-0_4.
Texto completoHoeffding, Wassily. "A Combinatorial Central Limit Theorem". En Springer Series in Statistics, 237–46. New York, NY: Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4612-0865-5_12.
Texto completoLengauer, Thomas. "Operations Research and Statistics". En Combinatorial Algorithms for Integrated Circuit Layout, 137–217. Wiesbaden: Vieweg+Teubner Verlag, 1990. http://dx.doi.org/10.1007/978-3-322-92106-2_4.
Texto completoBertsimas, Dimitris y Yinyu Ye. "Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics". En Handbook of Combinatorial Optimization, 1473–91. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4613-0303-9_24.
Texto completoKjos-Hanssen, Bjørn. "Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics". En Combinatorial Optimization and Applications, 652–65. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12691-3_49.
Texto completoFontana, Roberto y Fabio Rapallo. "Simulations on the Combinatorial Structure of D-Optimal Designs". En Statistics and Simulation, 343–53. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-76035-3_24.
Texto completoActas de conferencias sobre el tema "Combinatorial statistics"
Ishihata, 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 completoFejes Tóth, Péter, Ödön Vancsó y Manfred Borovcnik. "Combinatorial Thinking as Key for Introducing Hypothesis Testing—Evaluation of the Planned Secondary-School Reform in Hungary". En Bridging the Gap: Empowering and Educating Today’s Learners in Statistics. International Association for Statistical Education, 2022. http://dx.doi.org/10.52041/iase.icots11.t6f1.
Texto completoKim, Mansuck y Byung-Jun Yoon. "Efficient combinatorial drug optimization through stochastic search". En 2011 IEEE International Workshop on Genomic Signal Processing and Statistics (GENSIPS). IEEE, 2011. http://dx.doi.org/10.1109/gensips.2011.6169434.
Texto completoYunlu, Wang, Ye Xueyi y Zhao Zemao. "Steganalysis on echo hiding based on combinatorial high order statistics". En the First International Conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1734605.1734626.
Texto completoPodworny, Susanne, Daniel Frischemeier y Rolf Biehler. "Design, realization and evaluation of a statistics course for preservice teachers for primary school in Germany". En Teaching Statistics in a Data Rich World. International Association for Statistical Education, 2017. http://dx.doi.org/10.52041/srap.17309.
Texto completoVogrinec, Monika y Drago Bokal. "Doseganje višjih kognitivnih ciljev z vključevanjem hackathona v učni proces". En Values, Competencies and Changes in Organizations. University of Maribor Press, 2021. http://dx.doi.org/10.18690/978-961-286-442-2.75.
Texto completoSanjuan, E., M. Parra y I. Castro. "Multimedia tools for the teaching of probability and statistics". En Statistics and the Internet. International Association for Statistical Education, 2003. http://dx.doi.org/10.52041/srap.03312.
Texto completoWang, Dingwei. "Theoretical and statistic analysis on necessary bidder numbers for combinatorial auctions". En 2012 24th Chinese Control and Decision Conference (CCDC). IEEE, 2012. http://dx.doi.org/10.1109/ccdc.2012.6244330.
Texto completoFernández, Nicolás, Jaime García-García, Elizabeth Arredondo y Isaac Imilpán. "Knowledge of Binomial Distribution in Pre-service Mathematics Teachers". En Bridging the Gap: Empowering and Educating Today’s Learners in Statistics. International Association for Statistical Education, 2022. http://dx.doi.org/10.52041/iase.icots11.t8b2.
Texto completoHuang, Denggao, Hui Xie, Qiang Sun, Hongjie Ma y Tielong Shen. "A statistical evaluation model for driver-bus-route combinatorial optimization". En 2015 54th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE). IEEE, 2015. http://dx.doi.org/10.1109/sice.2015.7285419.
Texto completoInformes sobre el tema "Combinatorial statistics"
Mossel, Elchanan. Combinatorial Statistics on Trees and Networks. Fort Belvoir, VA: Defense Technical Information Center, septiembre de 2010. http://dx.doi.org/10.21236/ada531376.
Texto completoSrivastava, J. Multivariate Problems of Statistics, Combinatorics, Reliability, and Signal Processing. Fort Belvoir, VA: Defense Technical Information Center, octubre de 1992. http://dx.doi.org/10.21236/ada265213.
Texto completoSrivastava, J. N. Bose Memorial Conference on Statistical Design and Related Combinatorics. Fort Belvoir, VA: Defense Technical Information Center, septiembre de 1995. http://dx.doi.org/10.21236/ada299907.
Texto completoSrivastava, J. N. Bose Memorial Conference on Statistical Design and Related Combinatorics. Fort Belvoir, VA: Defense Technical Information Center, septiembre de 1995. http://dx.doi.org/10.21236/ada300029.
Texto completo