Livros sobre o tema "Algorithmes online"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 50 melhores livros para estudos sobre o assunto "Algorithmes online".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Veja os livros das mais diversas áreas científicas e compile uma bibliografia correta.
Evripidis, Bampis, Jansen Klaus e Kenyon Claire, eds. Efficient approximation and online algorithms: Recent progress on classical combinatorical optimization problems and new applications. New York: Springer, 2006.
Encontre o texto completo da fonteEvripidis, Bampis, Jansen Klaus e Kenyon Claire, eds. Efficient approximation and online algorithms: Recent progress on classical combinatorical optimization problems and new applications. New York: Springer, 2006.
Encontre o texto completo da fonteGiuseppe, Persiano, e Solis-Oba Roberto, eds. Approximation and online algorithms: Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004 : revised selected papers. Berlin: Springer, 2005.
Encontre o texto completo da fonteFiat, Amos, e Gerhard J. Woeginger, eds. Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029561.
Texto completo da fonteKaklamanis, Christos, e Asaf Levin, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80879-2.
Texto completo da fonteKoenemann, Jochen, e Britta Peis, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92702-8.
Texto completo da fonteChalermsook, Parinya, e Bundit Laekhanukit, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-18367-6.
Texto completo da fonteBampis, Evripidis, e Ola Svensson, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18263-6.
Texto completo da fonteSanità, Laura, e Martin Skutella, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-28684-6.
Texto completo da fonteErlebach, Thomas, e 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 completo da fonteSolis-Oba, Roberto, e 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 completo da fonteJansen, Klaus, e Monaldo Mastrolilli, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51741-4.
Texto completo da fonteSolis-Oba, Roberto, e Rudolf Fleischer, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89441-6.
Texto completo da fonteKaklamanis, Christos, e Kirk Pruhs, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08001-7.
Texto completo da fonteEpstein, Leah, e Thomas Erlebach, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04693-4.
Texto completo da fonteBampis, Evripidis, e Nicole Megow, eds. Approximation and Online Algorithms. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39479-0.
Texto completo da fonteErlebach, Thomas, e Christos Kaklamanis, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/11970125.
Texto completo da fonteJansen, Klaus, e 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 completo da fonteBampis, Evripidis, e 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 completo da fonteKaklamanis, Christos, e 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 completo da fontePersiano, Giuseppe, e Roberto Solis-Oba, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/b106130.
Texto completo da fonteSolis-Oba, Roberto, e Klaus Jansen, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/b95598.
Texto completo da fonteErlebach, Thomas, e Giuseppe Persinao, eds. Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11671411.
Texto completo da fonteBampis, Evripidis, e 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 completo da fonteByrka, Jarosław, e Andreas Wiese, eds. Approximation and Online Algorithms. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-49815-2.
Texto completo da fonteWAOA 2008 (2008 Karlesruhe, Germany). Approximation and online algorithms: 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008 : revised papers. Berlin: Springer, 2009.
Encontre o texto completo da fonteAmos, Fiat, e Woeginger Gerhard, eds. Online algorithms: The state of the art. Berlin: Springer, 1998.
Encontre o texto completo da fonteBampis, Evripidis, Klaus Jansen e Claire Kenyon, eds. Efficient Approximation and Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11671541.
Texto completo da fonteCole, Richard. Online algorithms for finger searching. New York: Courant Institute of Mathematical Sciences, New York University, 1991.
Encontre o texto completo da fonteDochow, 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 completo da fonteWang, Xinshang. Online Algorithms for Dynamic Resource Allocation Problems. [New York, N.Y.?]: [publisher not identified], 2017.
Encontre o texto completo da fonteBorodin, Allan. Online computation and competitive analysis. Cambridge, [Eng.]: Cambridge University Press, 1998.
Encontre o texto completo da fonteHentenryck, Pascal Van. Online stochastic combinatorial optimization. Cambridge, Mass: MIT Press, 2009.
Encontre o texto completo da fonteWAOA 2009 (2009 Copenhagen, Denmark). Approximation and online algorithms: 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 ; revised papers. Berlin: Springer, 2010.
Encontre o texto completo da fonteWang, Yu, Shiwen Mao e 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 completo da fonte1959-, McGeoch Lyle A., Sleator Daniel D. 1953- e DIMACS (Group), eds. On-line algorithms: Proceedings of a DIMACS workshop, February 11-13, 1991. Providence, R.I: American Mathematical Society, 1992.
Encontre o texto completo da fonteErtekin, Şeyda. Algorithms for efficient learning systems: Online and active learning approaches. Saarbrücken: VDM Verlag Dr. Müller, 2009.
Encontre o texto completo da fonteAngelopoulos, spyros. Efficient online algorithms for multicasting with bandwidth and dealy guarantees. Ottawa: National Library of Canada, 1999.
Encontre o texto completo da fontetu, Doina Logofa. Grundlegende Algorithmen mit Java: Vom Algorithmus zum fertigen Programm - Lern- und Arbeitsbuch fu r Informatiker und Mathematiker ; [mit Online-Service zum Buch]. Wiesbaden: Vieweg, 2008.
Encontre o texto completo da fonteChristos, Kaklamanis, e Skutella Martin, eds. Approximation and online algorithms: 5th international workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007 ; revised papers. Berlin: Springer, 2008.
Encontre o texto completo da fonteBucher, Taina. Affective Landscapes. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190493028.003.0005.
Texto completo da fonteOnline Algorithms. Cambridge University Press, 2022.
Encontre o texto completo da fonteGiuseppe, Persiano Thomas Erlebach. Approximation and Online Algorithms. Springer, 2008.
Encontre o texto completo da fonteSolis-Oba, Klaus Jansen Roberto. Approximation and Online Algorithms. Springer, 2011.
Encontre o texto completo da fontePersiano, Roberto Solis-Oba Giuseppe. Approximation and Online Algorithms. Springer, 2008.
Encontre o texto completo da fonteKaklamanis, Thomas Erlebach Christos. Approximation and Online Algorithms. Springer, 2008.
Encontre o texto completo da fonteSkutella, Christos Kaklamanis Martin. Approximation and Online Algorithms. Springer, 2008.
Encontre o texto completo da fonteKlaus, Jansen Evripidis Bampis Claire Kenyon. Efficient Approximation and Online Algorithms. Springer, 2008.
Encontre o texto completo da fonteRaghunathan, Arvind, e Richard Cole. Online Algorithms for Finger Searching. Creative Media Partners, LLC, 2018.
Encontre o texto completo da fonteVishwanathan, Sundar. Online algorithms for graph problems. 1993.
Encontre o texto completo da fonte