Conecte-se

Bibliografias temáticas / Algorithmes online / Livros

Livros sobre o tema "Algorithmes online"

Siga este link para ver outros tipos de publicações sobre o tema: Algorithmes online.

Autor: Grafiati

Publicado: 25 de maio de 2024

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

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.

1

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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Giuseppe, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Fiat, Amos, e Gerhard J. Woeginger, eds. Online Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0029561.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Kaklamanis, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Koenemann, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Chalermsook, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Bampis, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Sanità, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Erlebach, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

11

Solis-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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

12

Jansen, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

13

Solis-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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

14

Kaklamanis, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

15

Epstein, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

16

Bampis, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

17

Erlebach, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

18

Jansen, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

19

Bampis, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

20

Kaklamanis, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

21

Persiano, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

22

Solis-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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

23

Erlebach, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

24

Bampis, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

25

Byrka, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

26

WAOA 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

27

Amos, Fiat, e Woeginger Gerhard, eds. Online algorithms: The state of the art. Berlin: Springer, 1998.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

28

Bampis, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

29

Cole, Richard. Online algorithms for finger searching. New York: Courant Institute of Mathematical Sciences, New York University, 1991.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

30

Dochow, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

31

Wang, Xinshang. Online Algorithms for Dynamic Resource Allocation Problems. [New York, N.Y.?]: [publisher not identified], 2017.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

32

Borodin, Allan. Online computation and competitive analysis. Cambridge, [Eng.]: Cambridge University Press, 1998.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

33

Hentenryck, Pascal Van. Online stochastic combinatorial optimization. Cambridge, Mass: MIT Press, 2009.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

34

WAOA 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

35

Wang, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

36

1959-, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

37

Ertekin, Şeyda. Algorithms for efficient learning systems: Online and active learning approaches. Saarbrücken: VDM Verlag Dr. Müller, 2009.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

38

Angelopoulos, spyros. Efficient online algorithms for multicasting with bandwidth and dealy guarantees. Ottawa: National Library of Canada, 1999.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

39

tu, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

40

Christos, 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 fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

41

Bucher, Taina. Affective Landscapes. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190493028.003.0005.

Texto completo da fonte

Resumo:

Given the centrality of algorithms in the media landscape, how do they affect people’s everyday lives? Drawing on 35 interviews with social media users about their encounters with algorithms online, the chapter considers the barely perceived transitions in power that occur when algorithms and people meet. When do people encounter algorithms, and what responses and imaginations do these encounters generate? Analyzing specific situations in which users notice algorithmic mechanisms at work and start reflecting and talking about them, the chapter shows how the algorithmic output of social media becomes culturally meaningful, as seen in the ways that people form opinions about specific systems and act strategically around them. The notion of the algorithmic imaginary is put forward to suggest that it might not always matter what the algorithm is but rather how and when people imagine and perceive algorithms as this is what shapes their orientations toward platforms.

Estilos ABNT, Harvard, Vancouver, APA, etc.

42

Online Algorithms. Cambridge University Press, 2022.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

43

Giuseppe, Persiano Thomas Erlebach. Approximation and Online Algorithms. Springer, 2008.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

44

Solis-Oba, Klaus Jansen Roberto. Approximation and Online Algorithms. Springer, 2011.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

45

Persiano, Roberto Solis-Oba Giuseppe. Approximation and Online Algorithms. Springer, 2008.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

46

Kaklamanis, Thomas Erlebach Christos. Approximation and Online Algorithms. Springer, 2008.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

47

Skutella, Christos Kaklamanis Martin. Approximation and Online Algorithms. Springer, 2008.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

48

Klaus, Jansen Evripidis Bampis Claire Kenyon. Efficient Approximation and Online Algorithms. Springer, 2008.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

49

Raghunathan, Arvind, e Richard Cole. Online Algorithms for Finger Searching. Creative Media Partners, LLC, 2018.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

50

Vishwanathan, Sundar. Online algorithms for graph problems. 1993.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!