Libros sobre el tema "Online algorithms with recourse"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores mejores libros para su investigación sobre el tema "Online algorithms with recourse".
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 libros sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Fiat, Amos y Gerhard J. Woeginger, eds. Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029561.
Texto completoKaklamanis, Christos y Asaf Levin, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80879-2.
Texto completoKoenemann, Jochen y Britta Peis, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92702-8.
Texto completoChalermsook, Parinya y Bundit Laekhanukit, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-18367-6.
Texto completoBampis, Evripidis y Ola Svensson, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18263-6.
Texto completoSanità, Laura y Martin Skutella, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-28684-6.
Texto completoErlebach, Thomas y Giuseppe Persiano, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38016-7.
Texto completoSolis-Oba, Roberto y Giuseppe Persiano, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29116-6.
Texto completoJansen, Klaus y Monaldo Mastrolilli, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51741-4.
Texto completoSolis-Oba, Roberto y Rudolf Fleischer, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89441-6.
Texto completoKaklamanis, Christos y Kirk Pruhs, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08001-7.
Texto completoEpstein, Leah y Thomas Erlebach, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04693-4.
Texto completoBampis, Evripidis y Nicole Megow, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39479-0.
Texto completoErlebach, Thomas y Christos Kaklamanis, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/11970125.
Texto completoJansen, Klaus y Roberto Solis-Oba, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18318-8.
Texto completoBampis, Evripidis y Martin Skutella, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-93980-1.
Texto completoKaklamanis, Christos y Martin Skutella, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-77918-6.
Texto completoPersiano, Giuseppe y Roberto Solis-Oba, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/b106130.
Texto completoSolis-Oba, Roberto y Klaus Jansen, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/b95598.
Texto completoErlebach, Thomas y Giuseppe Persinao, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11671411.
Texto completoBampis, Evripidis y Klaus Jansen, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12450-1.
Texto completoByrka, Jarosław y Andreas Wiese, eds. Approximation and Online Algorithms. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-49815-2.
Texto completoBampis, Evripidis, Klaus Jansen y Claire Kenyon, eds. Efficient Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11671541.
Texto completoCole, Richard. Online algorithms for finger searching. New York: Courant Institute of Mathematical Sciences, New York University, 1991.
Buscar texto completoAmos, Fiat y Woeginger Gerhard, eds. Online algorithms: The state of the art. Berlin: Springer, 1998.
Buscar texto completoDochow, Robert. Online Algorithms for the Portfolio Selection Problem. Wiesbaden: Springer Fachmedien Wiesbaden, 2016. http://dx.doi.org/10.1007/978-3-658-13528-7.
Texto completoWang, Xinshang. Online Algorithms for Dynamic Resource Allocation Problems. [New York, N.Y.?]: [publisher not identified], 2017.
Buscar texto completoWang, Yu, Shiwen Mao y R. Mark Nelms. Online Algorithms for Optimal Energy Distribution in Microgrids. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17133-3.
Texto completoBorodin, Allan. Online computation and competitive analysis. Cambridge, [Eng.]: Cambridge University Press, 1998.
Buscar texto completoHentenryck, Pascal Van. Online stochastic combinatorial optimization. Cambridge, Mass: MIT Press, 2009.
Buscar texto completoWAOA 2009 (2009 Copenhagen, Denmark). Approximation and online algorithms: 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 ; revised papers. Berlin: Springer, 2010.
Buscar texto completoErtekin, Şeyda. Algorithms for efficient learning systems: Online and active learning approaches. Saarbrücken: VDM Verlag Dr. Müller, 2009.
Buscar texto completoAngelopoulos, spyros. Efficient online algorithms for multicasting with bandwidth and dealy guarantees. Ottawa: National Library of Canada, 1999.
Buscar texto completo1959-, McGeoch Lyle A., Sleator Daniel D. 1953- y DIMACS (Group), eds. On-line algorithms: Proceedings of a DIMACS workshop, February 11-13, 1991. Providence, R.I: American Mathematical Society, 1992.
Buscar texto completoChristos, Kaklamanis y Skutella Martin, eds. Approximation and online algorithms: 5th international workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007 ; revised papers. Berlin: Springer, 2008.
Buscar texto completoWAOA 2008 (2008 Karlesruhe, Germany). Approximation and online algorithms: 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008 : revised papers. Berlin: Springer, 2009.
Buscar texto completoOnline Algorithms. Cambridge University Press, 2022.
Buscar texto completoGiuseppe, Persiano Thomas Erlebach. Approximation and Online Algorithms. Springer, 2008.
Buscar texto completoSolis-Oba, Klaus Jansen Roberto. Approximation and Online Algorithms. Springer, 2011.
Buscar texto completoPersiano, Roberto Solis-Oba Giuseppe. Approximation and Online Algorithms. Springer, 2008.
Buscar texto completoKaklamanis, Thomas Erlebach Christos. Approximation and Online Algorithms. Springer, 2008.
Buscar texto completoSkutella, Christos Kaklamanis Martin. Approximation and Online Algorithms. Springer, 2008.
Buscar texto completoKlaus, Jansen Evripidis Bampis Claire Kenyon. Efficient Approximation and Online Algorithms. Springer, 2008.
Buscar texto completoRaghunathan, Arvind y Richard Cole. Online Algorithms for Finger Searching. Creative Media Partners, LLC, 2018.
Buscar texto completoVishwanathan, Sundar. Online algorithms for graph problems. 1993.
Buscar texto completoLi, Bin y Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 1999.
Buscar texto completoLi, Bin y Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 2018.
Buscar texto completoLi, Bin y Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 2018.
Buscar texto completoLi, Bin y Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 2018.
Buscar texto completoLi, Bin y Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 2018.
Buscar texto completo