Livros sobre o tema "Online algorithms with recourse"

Siga este link para ver outros tipos de publicações sobre o tema: Online algorithms with recourse.

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 "Online algorithms with recourse".

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

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.
2

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.
3

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.
4

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.
5

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.
6

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.
7

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.
8

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.
9

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.
10

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.
11

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.
12

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.
13

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.
14

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.
15

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.
16

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.
17

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.
18

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.
19

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.
20

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.
21

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.
22

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.
23

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.
24

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.
25

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.
26

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.
27

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.
28

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.
29

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.
30

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

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
31

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.
32

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.
33

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.
34

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.
35

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.
36

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.
37

Online Algorithms. Cambridge University Press, 2022.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
38

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

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
39

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

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
40

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

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
41

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

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
42

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

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
43

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.
44

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.
45

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

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
46

Li, Bin, e Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 1999.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
47

Li, Bin, e Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 2018.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
48

Li, Bin, e Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 2018.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
49

Li, Bin, e Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 2018.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
50

Li, Bin, e Steven Chu Hong Hoi. Online Portfolio Selection: Principles and Algorithms. Taylor & Francis Group, 2018.

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!

Vá para a bibliografia