Books on the topic 'Partitioning and placement algorithms'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 18 books for your research on the topic 'Partitioning and placement algorithms.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse books on a wide variety of disciplines and organise your bibliography correctly.
1934-, Zobrist George W., ed. Routing, placement, and partitioning. Norwood, N.J: Ablex, 1994.
Find full textCenter, Langley Research, ed. Approximate algorithms for partitioning and assignment problems. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1986.
Find full textWalshaw, C. Parallel optimisation algorithms for multilevel mesh partitioning. London: CMS Press, 1999.
Find full textS, Lueker George, ed. Probabilistic analysis of packing and partitioning algorithms. New York: Wiley, 1991.
Find full textS, Agaian S., ed. Multidimensional discrete unitary transforms: Representation, partitioning, and algorithms. New York: Marcel Dekker, 2003.
Find full textSchwartz, Victor Scott. Dynamic platform-independent meta-algorithms for graph-partitioning. Monterey, Calif: Naval Postgraduate School, 1998.
Find full textH, Bohkari Shahid, and Langley Research Center, eds. Efficient algorithms for a class of partitioning problems. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1990.
Find full textUnited 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.
Find full textTang, Xiaowei. Thre e extensions to force-directed placement for general graphs. Dublin: University College Dublin, 1998.
Find full textEl-Darzi, Elia. Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms. Uxbridge: Brunel University, 1988.
Find full textBader, 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. Providence, Rhode Island: American Mathematical Society, 2013.
Find full textBahoshy, N. M. Parallelization of algorithms by explicit partitioning. 1993.
Find full textDynamic Platform-Independent Meta-Algorithms for Graph-Partitioning. Storming Media, 1998.
Find full textGrigoryan, Artyom M., and Sos S. Agaian. Multidimensional Discrete Unitary Transforms : Representation: Partitioning, and Algorithms. Taylor & Francis Group, 2003.
Find full textF, Pierce John. Partitioning Algorithms for a Class of Knapsack Problems. Creative Media Partners, LLC, 2015.
Find full textGrigoryan, Artyom M., and Sos S. Agaian. Multidimensional Discrete Unitary Transforms : Representation: Partitioning, and Algorithms. Taylor & Francis Group, 2003.
Find full textAradau, Claudia, and Tobias Blanke. Algorithmic Reason. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780192859624.001.0001.
Full textAspden, Richard, and Jenny Gregory. Morphology. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780199668847.003.0011.
Full text