Books on the topic 'Algorithmes online'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 books for your research on the topic 'Algorithmes online.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse books on a wide variety of disciplines and organise your bibliography correctly.
Evripidis, Bampis, Jansen Klaus, and Kenyon Claire, eds. Efficient approximation and online algorithms: Recent progress on classical combinatorical optimization problems and new applications. Springer, 2006.
Find full textEvripidis, Bampis, Jansen Klaus, and Kenyon Claire, eds. Efficient approximation and online algorithms: Recent progress on classical combinatorical optimization problems and new applications. Springer, 2006.
Find full textFiat, Amos, and Gerhard J. Woeginger, eds. Online Algorithms. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029561.
Full textWAOA 2008 (2008 Karlesruhe, Germany). Approximation and online algorithms: 6th international workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008 : revised papers. Springer, 2009.
Find full textKaklamanis, Christos, and Asaf Levin, eds. Approximation and Online Algorithms. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80879-2.
Full textKoenemann, Jochen, and Britta Peis, eds. Approximation and Online Algorithms. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92702-8.
Full textChalermsook, Parinya, and Bundit Laekhanukit, eds. Approximation and Online Algorithms. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-18367-6.
Full textBampis, Evripidis, and Ola Svensson, eds. Approximation and Online Algorithms. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18263-6.
Full textSanità, Laura, and Martin Skutella, eds. Approximation and Online Algorithms. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-28684-6.
Full textErlebach, Thomas, and Giuseppe Persiano, eds. Approximation and Online Algorithms. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38016-7.
Full textSolis-Oba, Roberto, and Giuseppe Persiano, eds. Approximation and Online Algorithms. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29116-6.
Full textJansen, Klaus, and Monaldo Mastrolilli, eds. Approximation and Online Algorithms. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51741-4.
Full textSolis-Oba, Roberto, and Rudolf Fleischer, eds. Approximation and Online Algorithms. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-89441-6.
Full textKaklamanis, Christos, and Kirk Pruhs, eds. Approximation and Online Algorithms. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08001-7.
Full textEpstein, Leah, and Thomas Erlebach, eds. Approximation and Online Algorithms. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-04693-4.
Full textBampis, Evripidis, and Nicole Megow, eds. Approximation and Online Algorithms. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39479-0.
Full textErlebach, Thomas, and Christos Kaklamanis, eds. Approximation and Online Algorithms. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/11970125.
Full textJansen, Klaus, and Roberto Solis-Oba, eds. Approximation and Online Algorithms. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18318-8.
Full textBampis, Evripidis, and Martin Skutella, eds. Approximation and Online Algorithms. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-93980-1.
Full textKaklamanis, Christos, and Martin Skutella, eds. Approximation and Online Algorithms. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-77918-6.
Full textPersiano, Giuseppe, and Roberto Solis-Oba, eds. Approximation and Online Algorithms. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/b106130.
Full textSolis-Oba, Roberto, and Klaus Jansen, eds. Approximation and Online Algorithms. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/b95598.
Full textErlebach, Thomas, and Giuseppe Persinao, eds. Approximation and Online Algorithms. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11671411.
Full textBampis, Evripidis, and Klaus Jansen, eds. Approximation and Online Algorithms. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12450-1.
Full textByrka, Jarosław, and Andreas Wiese, eds. Approximation and Online Algorithms. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-49815-2.
Full textBieńkowski, Marcin, and Matthias Englert, eds. Approximation and Online Algorithms. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-81396-2.
Full textBampis, Evripidis, Klaus Jansen, and Claire Kenyon, eds. Efficient Approximation and Online Algorithms. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11671541.
Full textCole, Richard. Online algorithms for finger searching. Courant Institute of Mathematical Sciences, New York University, 1991.
Find full textDochow, Robert. Online Algorithms for the Portfolio Selection Problem. Springer Fachmedien Wiesbaden, 2016. http://dx.doi.org/10.1007/978-3-658-13528-7.
Full textAmos, Fiat, and Woeginger Gerhard, eds. Online algorithms: The state of the art. Springer, 1998.
Find full textWang, Xinshang. Online Algorithms for Dynamic Resource Allocation Problems. [publisher not identified], 2017.
Find full textWAOA 2009 (2009 Copenhagen, Denmark). Approximation and online algorithms: 7th international workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 ; revised papers. Springer, 2010.
Find full textBorodin, Allan. Online computation and competitive analysis. Cambridge University Press, 1998.
Find full textHentenryck, Pascal Van. Online stochastic combinatorial optimization. MIT Press, 2009.
Find full textWang, Yu, Shiwen Mao, and R. Mark Nelms. Online Algorithms for Optimal Energy Distribution in Microgrids. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17133-3.
Full textKong, Xiangyu, and Dazheng Feng. Efficient Online Learning Algorithms for Total Least Square Problems. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-1765-1.
Full textErtekin, Şeyda. Algorithms for efficient learning systems: Online and active learning approaches. VDM Verlag Dr. Müller, 2009.
Find full textAngelopoulos, spyros. Efficient online algorithms for multicasting with bandwidth and dealy guarantees. National Library of Canada, 1999.
Find full textBucher, Taina. Affective Landscapes. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190493028.003.0005.
Full textGiuseppe, Persiano Thomas Erlebach. Approximation and Online Algorithms. Springer, 2008.
Find full textSolis-Oba, Klaus Jansen Roberto. Approximation and Online Algorithms. Springer, 2011.
Find full textPersiano, Roberto Solis-Oba Giuseppe. Approximation and Online Algorithms. Springer, 2008.
Find full textKaklamanis, Thomas Erlebach Christos. Approximation and Online Algorithms. Springer, 2008.
Find full textSkutella, Christos Kaklamanis Martin. Approximation and Online Algorithms. Springer, 2008.
Find full textBucher, Taina. Life at the Top. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190493028.003.0004.
Full textKlaus, Jansen Evripidis Bampis Claire Kenyon. Efficient Approximation and Online Algorithms. Springer, 2008.
Find full textRaghunathan, Arvind, and Richard Cole. Online Algorithms for Finger Searching. Creative Media Partners, LLC, 2018.
Find full text