Livros sobre o tema "Algorithm efficiency"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Veja os 50 melhores livros para estudos sobre o assunto "Algorithm efficiency".
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.
United States. National Aeronautics and Space Administration., ed. Parallelization of the implicit RPLUS algorithm: Final report, NASA grant NAG 3-1472. National Aeronautics and Space Administration, 1994.
Encontre o texto completo da fonteUnited States. National Aeronautics and Space Administration., ed. Parallelization of the implicit RPLUS algorithm: Final report, NASA grant NAG 3-1472. National Aeronautics and Space Administration, 1997.
Encontre o texto completo da fonteAlan, Gibbons. Efficient parallel algorithms. Cambridge University Press, 1988.
Encontre o texto completo da fonteAlbers, Susanne, Helmut Alt, and Stefan Näher, eds. Efficient Algorithms. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03456-5.
Texto completo da fonteKronsjö, Lydia. Algorithms: Their complexity and efficiency. 2nd ed. Wiley, 1987.
Encontre o texto completo da fonteEvripidis, Bampis, Jansen Klaus, and Kenyon Claire, eds. Efficient approximation and online algorithms: Recent progress on classical combinatorical optimization problems and new applications. Springer, 2006.
Encontre o texto completo da fonteEvripidis, Bampis, Jansen Klaus, and Kenyon Claire, eds. Efficient approximation and online algorithms: Recent progress on classical combinatorical optimization problems and new applications. Springer, 2006.
Encontre o texto completo da fonteJansen, Klaus, Marian Margraf, Monaldo Mastrolilli, and José D. P. Rolim, eds. Experimental and Efficient Algorithms. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44867-5.
Texto completo da fonteNikoletseas, Sotiris E., ed. Experimental and Efficient Algorithms. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/b136461.
Texto completo da fonteRibeiro, Celso C., and Simone L. Martins, eds. Experimental and Efficient Algorithms. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/b97914.
Texto completo da fonteHochschild, Peter H. Resource-efficient parallel algorithms. Dept. of ComputerScience, Stanford University, 1985.
Encontre o texto completo da fonteCenter, Langley Research, ed. On the parallel efficiency of the Frederickson-McBryan multigrid. National Aeronautics and Space Administration, Langley Research Center, 1990.
Encontre o texto completo da fonteMonien, B., and Th Ottmann, eds. Data structures and efficient algorithms. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55488-2.
Texto completo da fonteBampis, Evripidis, Klaus Jansen, and Claire Kenyon, eds. Efficient Approximation and Online Algorithms. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11671541.
Texto completo da fonteGasperoni, Franco. Efficient algorithms for cyclic scheduling. Courant Institute of Mathematical Sciences, New York University, 1991.
Encontre o texto completo da fonteSalakhutdinov, Ruslan. Efficient optimization algorithms for learning. National Library of Canada, 2003.
Encontre o texto completo da fonteK, Kokula Krishna Hari, ed. Energy Efficient Node Placement Using Genetic Algorithm. Association of Scientists, Developers and Faculties, 2014.
Encontre o texto completo da fonteHenderson, Leslie Ann. Efficient algorithms for listing unlabeled graphs. University of Edinburgh Department of Computer Science, 1990.
Encontre o texto completo da fonteShukla, K. K., and Arvind K. Tiwari. Efficient Algorithms for Discrete Wavelet Transform. Springer London, 2013. http://dx.doi.org/10.1007/978-1-4471-4941-5.
Texto completo da fonteŁawryńczuk, Maciej. Computationally Efficient Model Predictive Control Algorithms. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04229-9.
Texto completo da fonteCantú-Paz, Erick. Efficient and Accurate Parallel Genetic Algorithms. Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-4369-5.
Texto completo da fonteRosário Lucas, Luís Filipe, Eduardo Antônio Barros da Silva, Sérgio Manuel Maciel de Faria, Nuno Miguel Morais Rodrigues, and Carla Liberal Pagliari. Efficient Predictive Algorithms for Image Compression. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51180-1.
Texto completo da fonteGoldberg, Leslie Ann. Efficient algorithms for listing combinatorial structures. Cambridge University Press, 1993.
Encontre o texto completo da fonteCantú-Paz, Erick. Efficient and accurate parallel genetic algorithms. Kluwer Academic Publishers, 2000.
Encontre o texto completo da fonteOmohundro, Stephen M. Efficient algorithms with neural network behavior. Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1987.
Encontre o texto completo da fonteCantú-Paz, Erick. Efficient and accurate parallel genetic algorithms. Springer Science+Business Media, LLC, 2001.
Encontre o texto completo da fonte1955-, Vitter Jeffrey Scott, ed. Efficient algorithms for MPEG video compression. Wiley, 2002.
Encontre o texto completo da fonteG, Larson Richard, and United States. National Aeronautics and Space Administration., eds. Labeled trees and the efficient computation of derivations. National Aeronautics and Space Administration, 1990.
Encontre o texto completo da fonteBrodnik, Andrej, Alejandro López-Ortiz, Venkatesh Raman, and Alfredo Viola, eds. Space-Efficient Data Structures, Streams, and Algorithms. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40273-9.
Texto completo da fonteShen, Hong. Efficient design and implementation of parallel algorithms. Åbo Akademis Förlag, 1991.
Encontre o texto completo da fonteCho, Chew Weng, ed. Fast and efficient algorithms in computational electromagnetics. Artech House, 2001.
Encontre o texto completo da fonteCevelev, Aleksandr. Strategic development of railway transport logistics. INFRA-M Academic Publishing LLC., 2021. http://dx.doi.org/10.12737/1194747.
Texto completo da fonteBenkeser, Christian. Power efficiency and the mapping of communication algorithms into VLSI. Hartung-Gorre, 2010.
Encontre o texto completo da fonteOceans, Canada Dept of Fisheries and. Efficient Frequency Domain Filtering Algorithm For Small Data Sets. s.n, 1987.
Encontre o texto completo da fonteAgarwal, Pankaj K. Partitioning arrangements of lines: I. An efficient deterministic algorithm. Courant Institute of Mathematical Sciences, New York University, 1989.
Encontre o texto completo da fonteZhang, Zhonghua. Smart TCT: An efficient algorithm for supervisory control design. National Library of Canada, 2001.
Encontre o texto completo da fonteDavid, Nicol, and Institute for Computer Applications in Science and Engineering., eds. Efficient bulk-loading of gridfiles. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1994.
Encontre o texto completo da fonteM, Nicol David, and Institute for Computer Applications in Science and Engineering., eds. Efficient bulk-loading of gridfiles. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1994.
Encontre o texto completo da fonteDavid, Nicol, and Institute for Computer Applications in Science and Engineering., eds. Efficient bulk-loading of gridfiles. Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1994.
Encontre o texto completo da fonteCenter, Langley Research, ed. Efficient algorithms for dilated mappings of binary trees. National Aeronautics and Space Administration, Langley Research Center, 1990.
Encontre o texto completo da fonteH, Bohkari Shahid, and Langley Research Center, eds. Efficient algorithms for a class of partitioning problems. National Aeronautics and Space Administration, Langley Research Center, 1990.
Encontre o texto completo da fonteB, Gatski T., and Langley Research Center, eds. Efficient parallel algorithm for direct numerical simulation of turbulent flows. National Aeronautics and Space Administration, Langley Research Center, 1997.
Encontre o texto completo da fonte1964-, Fleischer Rudolf, Moret B. M. E, and Schmidt E. M. 1945-, eds. Experimental algorithmics: From algorithm design to robust and efficient software. Springer, 2002.
Encontre o texto completo da fonteGoedecker, S. An efficient linear scaling algorithm for tight binding molecular dynamics. Cornell Theory Center, Cornell University, 1994.
Encontre o texto completo da fonteUnited States. National Aeronautics and Space Administration., ed. An efficient algorithm for computing the crossovers in satellite altimetry. National Aeronautics and Space Administration, 1988.
Encontre o texto completo da fonte1964-, Fleischer Rudolf, Moret B. M. E, and Schmidt E. M. 1945-, eds. Experimental algorithmics: From algorithm design to robust and efficient software. Springer, 2002.
Encontre o texto completo da fonteWEA 2004 (2004 Angra dos Reis, Brazil). Experimental and efficient algorithms: Third international workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004 : proceedings. Springer, 2004.
Encontre o texto completo da fonteDahane, Amine, and Nasr-Eddine Berrached. Mobile, Wireless and Sensor Networks: A Clustering Algorithm for Energy Efficiency and Safety. Apple Academic Press, Incorporated, 2019.
Encontre o texto completo da fonteDahane, Amine, and Nasr-Eddine Berrached. Mobile, Wireless and Sensor Networks: A Clustering Algorithm for Energy Efficiency and Safety. Apple Academic Press, Incorporated, 2019.
Encontre o texto completo da fonteWestphal, Christian. 21FTM09, Algorithm-Based Optimization of Gear Mesh Efficiency in Stepped Planetary Gear Stages for Electric Vehicles. American Gear Manufacturers Association, 2021.
Encontre o texto completo da fonte