Siga este enlace para ver otros tipos de publicaciones sobre el tema: Partitioning and placement algorithms.

Libros sobre el tema "Partitioning and placement algorithms"

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

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.

1

1934-, Zobrist George W., ed. Routing, placement, and partitioning. Ablex, 1994.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Center, Langley Research, ed. Approximate algorithms for partitioning and assignment problems. National Aeronautics and Space Administration, Langley Research Center, 1986.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Walshaw, C. Parallel optimisation algorithms for multilevel mesh partitioning. CMS Press, 1999.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

S, Lueker George, ed. Probabilistic analysis of packing and partitioning algorithms. Wiley, 1991.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

S, Agaian S., ed. Multidimensional discrete unitary transforms: Representation, partitioning, and algorithms. Marcel Dekker, 2003.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Schwartz, Victor Scott. Dynamic platform-independent meta-algorithms for graph-partitioning. Naval Postgraduate School, 1998.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

H, Bohkari Shahid, and Langley Research Center, eds. Efficient algorithms for a class of partitioning problems. National Aeronautics and Space Administration, Langley Research Center, 1990.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

United States. National Aeronautics and Space Administration., ed. Parallel algorithms for placement and routing in VLSI design. [University of Illinois at Urbana-Champaign, 1991.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Tang, Xiaowei. Thre e extensions to force-directed placement for general graphs. University College Dublin, 1998.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

El-Darzi, Elia. Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms. Brunel University, 1988.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
11

Bader, David A., 1969- editor of compilation, Meyerhenke, Henning, 1978- editor of compilation, Sanders, Peter, editor of compilation, and 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. American Mathematical Society, 2013.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
12

Bahoshy, N. M. Parallelization of algorithms by explicit partitioning. 1993.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
13

Dynamic Platform-Independent Meta-Algorithms for Graph-Partitioning. Storming Media, 1998.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
14

Grigoryan, Artyom M., and Sos S. Agaian. Multidimensional Discrete Unitary Transforms : Representation: Partitioning, and Algorithms. Taylor & Francis Group, 2003.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
15

F, Pierce John. Partitioning Algorithms for a Class of Knapsack Problems. Creative Media Partners, LLC, 2015.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
16

Grigoryan, Artyom M., and Sos S. Agaian. Multidimensional Discrete Unitary Transforms : Representation: Partitioning, and Algorithms. Taylor & Francis Group, 2003.

Buscar texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
17

Aradau, Claudia, and Tobias Blanke. Algorithmic Reason. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780192859624.001.0001.

Texto completo
Resumen
Are algorithms ruling the world today? Is artificial intelligence making life-and-death decisions? Are social media companies able to manipulate elections? As we are confronted with public and academic anxieties about unprecedented changes, this book offers a different analytical prism to investigate these transformations as more mundane and fraught. Aradau and Blanke develop conceptual and methodological tools to understand how algorithmic operations shape the government of self and other. While disperse and messy, these operations are held together by an ascendant algorithmic reason. Through
Los estilos APA, Harvard, Vancouver, ISO, etc.
18

Aspden, Richard, and Jenny Gregory. Morphology. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780199668847.003.0011.

Texto completo
Resumen
The study of joint morphology can help us to understand the risk factors for osteoarthritis (OA), how it progresses, and aids in developing imaging biomarkers for study of the disease. OA results in gross structural changes in affected joints. Growth of osteophytes, deformation of joint components, and loss of joint space where cartilage has broken down are all characteristics of the disorder. Certain bone shapes as well as malalignment predispose people to future OA, or may be a marker for early OA. Geometrical measures, such as the alpha angle or Wiberg’s CE angle, used to be the primary too
Los estilos APA, Harvard, Vancouver, ISO, etc.
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!