Libros sobre el tema "Partitioning and placement algorithms"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 18 mejores mejores libros para su investigación sobre el tema "Partitioning and placement algorithms".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore libros sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
1934-, Zobrist George W., ed. Routing, placement, and partitioning. Norwood, N.J: Ablex, 1994.
Buscar texto completoCenter, Langley Research, ed. Approximate algorithms for partitioning and assignment problems. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1986.
Buscar texto completoWalshaw, C. Parallel optimisation algorithms for multilevel mesh partitioning. London: CMS Press, 1999.
Buscar texto completoS, Lueker George, ed. Probabilistic analysis of packing and partitioning algorithms. New York: Wiley, 1991.
Buscar texto completoS, Agaian S., ed. Multidimensional discrete unitary transforms: Representation, partitioning, and algorithms. New York: Marcel Dekker, 2003.
Buscar texto completoSchwartz, Victor Scott. Dynamic platform-independent meta-algorithms for graph-partitioning. Monterey, Calif: Naval Postgraduate School, 1998.
Buscar texto completoH, Bohkari Shahid y Langley Research Center, eds. Efficient algorithms for a class of partitioning problems. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1990.
Buscar texto completoUnited States. National Aeronautics and Space Administration., ed. Parallel algorithms for placement and routing in VLSI design. Urbana, Ill: [University of Illinois at Urbana-Champaign, 1991.
Buscar texto completoTang, Xiaowei. Thre e extensions to force-directed placement for general graphs. Dublin: University College Dublin, 1998.
Buscar texto completoEl-Darzi, Elia. Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms. Uxbridge: Brunel University, 1988.
Buscar texto completoBader, David A., 1969- editor of compilation, Meyerhenke, Henning, 1978- editor of compilation, Sanders, Peter, editor of compilation y Wagner, Dorothea, 1957- editor of compilation, eds. Graph partitioning and graph clustering: 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA. Providence, Rhode Island: American Mathematical Society, 2013.
Buscar texto completoBahoshy, N. M. Parallelization of algorithms by explicit partitioning. 1993.
Buscar texto completoDynamic Platform-Independent Meta-Algorithms for Graph-Partitioning. Storming Media, 1998.
Buscar texto completoGrigoryan, Artyom M. y Sos S. Agaian. Multidimensional Discrete Unitary Transforms : Representation: Partitioning, and Algorithms. Taylor & Francis Group, 2003.
Buscar texto completoF, Pierce John. Partitioning Algorithms for a Class of Knapsack Problems. Creative Media Partners, LLC, 2015.
Buscar texto completoGrigoryan, Artyom M. y Sos S. Agaian. Multidimensional Discrete Unitary Transforms : Representation: Partitioning, and Algorithms. Taylor & Francis Group, 2003.
Buscar texto completoAradau, Claudia y Tobias Blanke. Algorithmic Reason. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780192859624.001.0001.
Texto completoAspden, Richard y Jenny Gregory. Morphology. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780199668847.003.0011.
Texto completo