Literatura académica sobre el tema "Partitioning and placement algorithms"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas 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.
Artículos de revistas sobre el tema "Partitioning and placement algorithms"
Ababei, Cristinel. "Speeding Up FPGA Placement via Partitioning and Multithreading". International Journal of Reconfigurable Computing 2009 (2009): 1–9. http://dx.doi.org/10.1155/2009/514754.
Texto completoAreibi, Shawki y Zhen Yang. "Effective Memetic Algorithms for VLSI Design = Genetic Algorithms + Local Search + Multi-Level Clustering". Evolutionary Computation 12, n.º 3 (septiembre de 2004): 327–53. http://dx.doi.org/10.1162/1063656041774947.
Texto completoLiu, Huiqun, Kai Zhu y D. F. Wong. "FPGA Partitioning with Complex Resource Constraints". VLSI Design 11, n.º 3 (1 de enero de 2000): 219–35. http://dx.doi.org/10.1155/2000/12198.
Texto completoSaab, Youssef. "A Fast Clustering-Based Min-Cut Placement Algorithm With Simulated-Annealing Performance". VLSI Design 5, n.º 1 (1 de enero de 1996): 37–48. http://dx.doi.org/10.1155/1996/58084.
Texto completoShanavas, I. Hameem y R. K. Gnanamurthy. "Optimal Solution for VLSI Physical Design Automation Using Hybrid Genetic Algorithm". Mathematical Problems in Engineering 2014 (2014): 1–15. http://dx.doi.org/10.1155/2014/809642.
Texto completoYanpei, Liu, Li Chunlin, Yang Zhiyong, Chen Yuxuan y Xu Lijun. "Performance Guarantee Mechanism for Multi-Tenancy SaaS Service Based on Kalman Filtering". Cybernetics and Information Technologies 15, n.º 3 (1 de septiembre de 2015): 150–64. http://dx.doi.org/10.1515/cait-2015-0048.
Texto completoSminesh, C. N., E. Grace Mary Kanaga y A. G. Sreejish. "Augmented Affinity Propagation-Based Network Partitioning for Multiple Controllers Placement in Software Defined Networks". Journal of Computational and Theoretical Nanoscience 17, n.º 1 (1 de enero de 2020): 228–33. http://dx.doi.org/10.1166/jctn.2020.8655.
Texto completoLi, Jiaqi, Yiqiang Sheng y Haojiang Deng. "Two Optimization Algorithms for Name-Resolution Server Placement in Information-Centric Networking". Applied Sciences 10, n.º 10 (22 de mayo de 2020): 3588. http://dx.doi.org/10.3390/app10103588.
Texto completoYun, Seung-kook y Daniela Rus. "Distributed coverage with mobile robots on a graph: locational optimization and equal-mass partitioning". Robotica 32, n.º 2 (18 de diciembre de 2013): 257–77. http://dx.doi.org/10.1017/s0263574713001148.
Texto completoSreenivasa Rao, K., N. Swapna y P. Praveen Kumar. "Educational data mining for student placement prediction using machine learning algorithms". International Journal of Engineering & Technology 7, n.º 1.2 (28 de diciembre de 2017): 43. http://dx.doi.org/10.14419/ijet.v7i1.2.8988.
Texto completoTesis sobre el tema "Partitioning and placement algorithms"
Stan, Oana. "Placement of tasks under uncertainty on massively multicore architectures". Thesis, Compiègne, 2013. http://www.theses.fr/2013COMP2116/document.
Texto completoThis PhD thesis is devoted to the study of combinatorial optimization problems related to massively parallel embedded architectures when taking into account uncertain data (e.g. execution time). Our focus is on chance constrained programs with the objective of finding the best solution which is feasible with a preset probability guarantee. A qualitative analysis of the uncertain data we have to treat (dependent random variables, multimodal, multidimensional, difficult to characterize through classical distributions) has lead us to design a non parametric method, the so-called "robust binomial approach", valid whatever the joint distribution and which is based on robust optimization and statistical hypothesis testing. We also propose a methodology for adapting approximate algorithms for solving stochastic problems by integrating the robust binomial approach when verifying for solution feasibility. The paractical relevance of our approach is validated through two problems arising in the compilation of dataflow application for manycore platforms. The first problem treats the stochastic partitioning of networks of processes on a fixed set of nodes, by taking into account the load of each node and the uncertainty affecting the weight of the processes. For finding stochastic solutions, a semi-greedy iterative algorithm has been proposed which allowed measuring the robustness and cost of the solutions with regard to those for the deterministic version of the problem. The second problem consists in studying the global placement and routing of dataflow applications on a clusterized architecture. The purpose being to place the processes on clusters such that it exists a feasible routing, a GRASP heuristic has been conceived first for the deterministic case and afterwards extended for the chance constrained variant of the problem
URGESE, GIANVITO. "Computational Methods for Bioinformatics Analysis and Neuromorphic Computing". Doctoral thesis, Politecnico di Torino, 2016. http://hdl.handle.net/11583/2646486.
Texto completoTrifunovic, Aleksandar. "Parallel algorithms for hypergraph partitioning". Thesis, Imperial College London, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.430537.
Texto completoAslan, Burak Galip Püskülcü Halis. "Heuristic container placement algorithms/". [s.l.]: [s.n.], 2003. http://library.iyte.edu.tr/tezler/master/bilgisayaryazilimi/T000268.rar.
Texto completoBahoshy, Nimatallah M. "Parallelization of algorithms by explicit partitioning". Thesis, Loughborough University, 1992. https://dspace.lboro.ac.uk/2134/27004.
Texto completoZanetti, Luca. "Algorithms for partitioning well-clustered graphs". Thesis, University of Bristol, 2018. http://hdl.handle.net/1983/e6ba8929-6488-4277-b91b-4f4f7eda2b26.
Texto completoMUPPIDI, SRINIVAS REDDY. "GENETIC ALGORITHMS FOR MULTI-OBJECTIVE PARTITIONING". University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1080827924.
Texto completoVijaya, Satya Ravi. "ALGORITHMS FOR HAPLOTYPE INFERENCE AND BLOCK PARTITIONING". Doctoral diss., University of Central Florida, 2006. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2490.
Texto completoPh.D.
Other
Engineering and Computer Science
Computer Science
Martin, Nicolas. "Network partitioning algorithms with scale-free objective". Thesis, Université Grenoble Alpes, 2020. http://www.theses.fr/2020GRALT001.
Texto completoIn light of the complexity induced by large-scale networks, the design of network partitioning algorithms and related problematics are at the heart of this thesis. First, we raise a preliminary question on the structure of the partition itself: as the parts may includes disconnected nodes, we want to quantify the drawbacks to impose the nodes inside each part to be connected. Then we study the design of a partitioning algorithm inducing a reduced scale-free network. This allows to take advantage of the inherent features of this type of network. We also focus on the properties to preserve to respect the physical and dynamical profile of the initial network. We investigate then how to partition a network between measured and unmeasured nodes ensuring that the average of the unmeasured nodes can be efficiently reconstructed. In particular we show that, under hypothesis, this problem can be reduced to a problem of detection of subgraph with particular properties. Methods to achieve this detection are proposed. Finally, three applications are presented: first we apply the partitioning algorithm inducing scale-freeness to a large-scale urban traffic network. We show then that, thanks to the properties preserved through the partition, the reduced network can be used as an abstraction of the initial network. The second and third applications deal with network epidemics. First, we show that the scale-freeness of the abstracting network can be used to build a cure-assignation strategy. In the last application, we take advantage of the result on average reconstruction to estimate the evolution of a disease on a large-scale network
Liu, Huiqun. "Circuit partitioning algorithms for CAD VLSI design /". Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.
Texto completoLibros sobre el tema "Partitioning and placement algorithms"
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 completoCapítulos de libros sobre el tema "Partitioning and placement algorithms"
Pushpa, J. y Pethuru Raj Chelliah. "Expounding k-means-inspired network partitioning algorithm for SDN Controller Placement". En Applied Learning Algorithms for Intelligent IoT, 265–90. Boca Raton: Auerbach Publications, 2021. http://dx.doi.org/10.1201/9781003119838-12.
Texto completoKennings, Andrew A. y Igor L. Markov. "Circuit Placement". En Encyclopedia of Algorithms, 301–6. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_69.
Texto completoKennings, Andrew A. y Igor L.Markov. "Circuit Placement". En Encyclopedia of Algorithms, 1–7. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_69-2.
Texto completoKennings, Andrew A. y Igor L. Markov. "Circuit Placement". En Encyclopedia of Algorithms, 143–46. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_69.
Texto completoSherwani, Naveed A. "Partitioning". En Algorithms for VLSI Physical Design Automation, 125–58. Boston, MA: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4757-2219-2_4.
Texto completoSherwani, Naveed. "Partitioning". En Algorithms for VLSI Physical Design Automation, 141–74. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4615-2351-2_4.
Texto completoLi, Angsheng y Peng Zhang. "Unbalanced Graph Partitioning". En Algorithms and Computation, 218–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17517-6_21.
Texto completoWeiss, William. "Partitioning Topological Spaces". En Algorithms and Combinatorics, 154–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/978-3-642-72905-8_11.
Texto completoOsipov, Vitaly, Peter Sanders y Christian Schulz. "Engineering Graph Partitioning Algorithms". En Experimental Algorithms, 18–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30850-5_3.
Texto completoSriram, M. y S. M. Kang. "System Partitioning and Chip Placement". En Physical Design for Multichip Modules, 69–97. Boston, MA: Springer US, 1994. http://dx.doi.org/10.1007/978-1-4615-2682-7_3.
Texto completoActas de conferencias sobre el tema "Partitioning and placement algorithms"
Li, Jianhua, Laleh Behjat y Logan Rakai. "Clustering algorithms for circuit partitioning and placement problems". En 2007 European Conference on Circuit Theory and Design (ECCTD 2007). IEEE, 2007. http://dx.doi.org/10.1109/ecctd.2007.4529654.
Texto completoCong, Jason, Michail Romesis y Min Xie. "Optimality, scalability and stability study of partitioning and placement algorithms". En the 2003 international symposium. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/640000.640021.
Texto completoBazylevych, Roman y Lubov Bazylevych. "The methodology and algorithms for solving the very large-scale physical design automation problems: Partitioning, packaging, placement and routing". En 2013 2nd Mediterranean Conference on Embedded Computing (MECO). IEEE, 2013. http://dx.doi.org/10.1109/meco.2013.6601386.
Texto completoYao, Wenbin, Zhen Guo y Dongbin Wang. "An Energy Efficient Virtual Machine Placement Algorithm Based on Graph Partitioning in Cloud Data Center". En 2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA/IUCC). IEEE, 2017. http://dx.doi.org/10.1109/ispa/iucc.2017.00066.
Texto completoYang, Zhiyuan y Ankur Srivastava. "Co-Placement for Pin-Fin Based Micro-Fluidically Cooled 3D ICs". En ASME 2015 International Technical Conference and Exhibition on Packaging and Integration of Electronic and Photonic Microsystems collocated with the ASME 2015 13th International Conference on Nanochannels, Microchannels, and Minichannels. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/ipack2015-48354.
Texto completoAL-Qahtani, Ghazi D. y Noah Berlow. "Large Scale Placement For Multilateral Wells Using Network Optimization". En SPE Middle East Oil & Gas Show and Conference. SPE, 2021. http://dx.doi.org/10.2118/204803-ms.
Texto completoVerplaetse, P., J. Dambre, D. Stroobandt y J. Van Campenhout. "On partitioning vs. placement rent properties". En the 2001 international workshop. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/368640.368665.
Texto completoRavichandran, Ramprasad, Mike Niemier y Sung Kyu Lim. "Partitioning and placement for buildable QCA circuits". En the 2005 conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1120725.1120902.
Texto completoCan Yildiz, Mehmet y Patrick H. Madden. "Improved cut sequences for partitioning based placement". En the 38th conference. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/378239.379064.
Texto completoMadden, P. "Session details: Session 4: Partitioning & Placement". En ISPD03: International Symposium on Physical Design. New York, NY, USA: ACM, 2003. http://dx.doi.org/10.1145/3248312.
Texto completoInformes sobre el tema "Partitioning and placement algorithms"
Abou-rjeili, Amine y George Karypis. Multilevel Algorithms for Partitioning Power-Law Graphs. Fort Belvoir, VA: Defense Technical Information Center, octubre de 2005. http://dx.doi.org/10.21236/ada439402.
Texto completoSelvakkumaran, Navaratnasothie, Abhishek Ranjan, Salil Raje y George Karypis. Scalable Partitioning Algorithms for FPGAs With Heterogeneous Resources. Fort Belvoir, VA: Defense Technical Information Center, septiembre de 2004. http://dx.doi.org/10.21236/ada439474.
Texto completoMoulitsas, Irene y George Karypis. Partitioning Algorithms for Simultaneously Balancing Iterative and Direct Methods. Fort Belvoir, VA: Defense Technical Information Center, marzo de 2004. http://dx.doi.org/10.21236/ada439418.
Texto completoKashyap, Abhishek, Samir Khuller y Mark Shayman. Relay Placement Approximation Algorithms for k-Connectivity in Wireless Sensor Networks. Fort Belvoir, VA: Defense Technical Information Center, enero de 2006. http://dx.doi.org/10.21236/ada455438.
Texto completoSelvakkumaran, Navaratnasothie y George Karypis. Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. Fort Belvoir, VA: Defense Technical Information Center, septiembre de 2004. http://dx.doi.org/10.21236/ada439471.
Texto completoSelvakkumaran, Navaratnasothie y George Karypis. Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. Fort Belvoir, VA: Defense Technical Information Center, abril de 2003. http://dx.doi.org/10.21236/ada439577.
Texto completoLing, Hao. Application of Model-Based Signal Processing and Genetic Algorithms for Shipboard Antenna Design, Placement Optimization. Fort Belvoir, VA: Defense Technical Information Center, enero de 2002. http://dx.doi.org/10.21236/ada399555.
Texto completoBanks, Jeffrey. CARPE DIEM: Coupled Algorithms for Robust Partitioning of Equations for the Dynamic Interactions of Evolving Materials. Office of Scientific and Technical Information (OSTI), noviembre de 2021. http://dx.doi.org/10.2172/1829714.
Texto completoIdakwo, Gabriel, Sundar Thangapandian, Joseph Luttrell, Zhaoxian Zhou, Chaoyang Zhang y Ping Gong. Deep learning-based structure-activity relationship modeling for multi-category toxicity classification : a case study of 10K Tox21 chemicals with high-throughput cell-based androgen receptor bioassay data. Engineer Research and Development Center (U.S.), julio de 2021. http://dx.doi.org/10.21079/11681/41302.
Texto completoSinclair, Samantha y Sandra LeGrand. Reproducibility assessment and uncertainty quantification in subjective dust source mapping. Engineer Research and Development Center (U.S.), agosto de 2021. http://dx.doi.org/10.21079/11681/41523.
Texto completo