Добірка наукової літератури з теми "Partitioning and placement algorithms"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Partitioning and placement algorithms".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "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.
Повний текст джерелаAreibi, Shawki, and Zhen Yang. "Effective Memetic Algorithms for VLSI Design = Genetic Algorithms + Local Search + Multi-Level Clustering." Evolutionary Computation 12, no. 3 (September 2004): 327–53. http://dx.doi.org/10.1162/1063656041774947.
Повний текст джерелаLiu, Huiqun, Kai Zhu, and D. F. Wong. "FPGA Partitioning with Complex Resource Constraints." VLSI Design 11, no. 3 (January 1, 2000): 219–35. http://dx.doi.org/10.1155/2000/12198.
Повний текст джерелаSaab, Youssef. "A Fast Clustering-Based Min-Cut Placement Algorithm With Simulated-Annealing Performance." VLSI Design 5, no. 1 (January 1, 1996): 37–48. http://dx.doi.org/10.1155/1996/58084.
Повний текст джерелаShanavas, I. Hameem, and 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.
Повний текст джерелаYanpei, Liu, Li Chunlin, Yang Zhiyong, Chen Yuxuan, and Xu Lijun. "Performance Guarantee Mechanism for Multi-Tenancy SaaS Service Based on Kalman Filtering." Cybernetics and Information Technologies 15, no. 3 (September 1, 2015): 150–64. http://dx.doi.org/10.1515/cait-2015-0048.
Повний текст джерелаSminesh, C. N., E. Grace Mary Kanaga, and A. G. Sreejish. "Augmented Affinity Propagation-Based Network Partitioning for Multiple Controllers Placement in Software Defined Networks." Journal of Computational and Theoretical Nanoscience 17, no. 1 (January 1, 2020): 228–33. http://dx.doi.org/10.1166/jctn.2020.8655.
Повний текст джерелаLi, Jiaqi, Yiqiang Sheng, and Haojiang Deng. "Two Optimization Algorithms for Name-Resolution Server Placement in Information-Centric Networking." Applied Sciences 10, no. 10 (May 22, 2020): 3588. http://dx.doi.org/10.3390/app10103588.
Повний текст джерелаYun, Seung-kook, and Daniela Rus. "Distributed coverage with mobile robots on a graph: locational optimization and equal-mass partitioning." Robotica 32, no. 2 (December 18, 2013): 257–77. http://dx.doi.org/10.1017/s0263574713001148.
Повний текст джерелаSreenivasa Rao, K., N. Swapna, and P. Praveen Kumar. "Educational data mining for student placement prediction using machine learning algorithms." International Journal of Engineering & Technology 7, no. 1.2 (December 28, 2017): 43. http://dx.doi.org/10.14419/ijet.v7i1.2.8988.
Повний текст джерелаДисертації з теми "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.
Повний текст джерелаThis 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.
Повний текст джерелаTrifunovic, Aleksandar. "Parallel algorithms for hypergraph partitioning." Thesis, Imperial College London, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.430537.
Повний текст джерелаAslan, 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.
Повний текст джерелаBahoshy, Nimatallah M. "Parallelization of algorithms by explicit partitioning." Thesis, Loughborough University, 1992. https://dspace.lboro.ac.uk/2134/27004.
Повний текст джерелаZanetti, Luca. "Algorithms for partitioning well-clustered graphs." Thesis, University of Bristol, 2018. http://hdl.handle.net/1983/e6ba8929-6488-4277-b91b-4f4f7eda2b26.
Повний текст джерелаMUPPIDI, SRINIVAS REDDY. "GENETIC ALGORITHMS FOR MULTI-OBJECTIVE PARTITIONING." University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1080827924.
Повний текст джерелаVijaya, 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.
Повний текст джерелаPh.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.
Повний текст джерелаIn 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.
Повний текст джерелаКниги з теми "Partitioning and placement algorithms"
1934-, Zobrist George W., ed. Routing, placement, and partitioning. Norwood, N.J: Ablex, 1994.
Знайти повний текст джерелаCenter, Langley Research, ed. Approximate algorithms for partitioning and assignment problems. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1986.
Знайти повний текст джерелаWalshaw, C. Parallel optimisation algorithms for multilevel mesh partitioning. London: CMS Press, 1999.
Знайти повний текст джерелаS, Lueker George, ed. Probabilistic analysis of packing and partitioning algorithms. New York: Wiley, 1991.
Знайти повний текст джерелаS, Agaian S., ed. Multidimensional discrete unitary transforms: Representation, partitioning, and algorithms. New York: Marcel Dekker, 2003.
Знайти повний текст джерелаSchwartz, Victor Scott. Dynamic platform-independent meta-algorithms for graph-partitioning. Monterey, Calif: Naval Postgraduate School, 1998.
Знайти повний текст джерелаH, 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.
Знайти повний текст джерелаUnited 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.
Знайти повний текст джерелаTang, Xiaowei. Thre e extensions to force-directed placement for general graphs. Dublin: University College Dublin, 1998.
Знайти повний текст джерелаEl-Darzi, Elia. Methods for solving the set covering and set partitioning problems using graph theoretic (relaxation) algorithms. Uxbridge: Brunel University, 1988.
Знайти повний текст джерелаЧастини книг з теми "Partitioning and placement algorithms"
Pushpa, J., and Pethuru Raj Chelliah. "Expounding k-means-inspired network partitioning algorithm for SDN Controller Placement." In Applied Learning Algorithms for Intelligent IoT, 265–90. Boca Raton: Auerbach Publications, 2021. http://dx.doi.org/10.1201/9781003119838-12.
Повний текст джерелаKennings, Andrew A., and Igor L. Markov. "Circuit Placement." In Encyclopedia of Algorithms, 301–6. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_69.
Повний текст джерелаKennings, Andrew A., and Igor L.Markov. "Circuit Placement." In Encyclopedia of Algorithms, 1–7. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_69-2.
Повний текст джерелаKennings, Andrew A., and Igor L. Markov. "Circuit Placement." In Encyclopedia of Algorithms, 143–46. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_69.
Повний текст джерелаSherwani, Naveed A. "Partitioning." In 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.
Повний текст джерелаSherwani, Naveed. "Partitioning." In 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.
Повний текст джерелаLi, Angsheng, and Peng Zhang. "Unbalanced Graph Partitioning." In Algorithms and Computation, 218–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17517-6_21.
Повний текст джерелаWeiss, William. "Partitioning Topological Spaces." In Algorithms and Combinatorics, 154–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/978-3-642-72905-8_11.
Повний текст джерелаOsipov, Vitaly, Peter Sanders, and Christian Schulz. "Engineering Graph Partitioning Algorithms." In Experimental Algorithms, 18–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30850-5_3.
Повний текст джерелаSriram, M., and S. M. Kang. "System Partitioning and Chip Placement." In Physical Design for Multichip Modules, 69–97. Boston, MA: Springer US, 1994. http://dx.doi.org/10.1007/978-1-4615-2682-7_3.
Повний текст джерелаТези доповідей конференцій з теми "Partitioning and placement algorithms"
Li, Jianhua, Laleh Behjat, and Logan Rakai. "Clustering algorithms for circuit partitioning and placement problems." In 2007 European Conference on Circuit Theory and Design (ECCTD 2007). IEEE, 2007. http://dx.doi.org/10.1109/ecctd.2007.4529654.
Повний текст джерелаCong, Jason, Michail Romesis, and Min Xie. "Optimality, scalability and stability study of partitioning and placement algorithms." In the 2003 international symposium. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/640000.640021.
Повний текст джерелаBazylevych, Roman, and Lubov Bazylevych. "The methodology and algorithms for solving the very large-scale physical design automation problems: Partitioning, packaging, placement and routing." In 2013 2nd Mediterranean Conference on Embedded Computing (MECO). IEEE, 2013. http://dx.doi.org/10.1109/meco.2013.6601386.
Повний текст джерелаYao, Wenbin, Zhen Guo, and Dongbin Wang. "An Energy Efficient Virtual Machine Placement Algorithm Based on Graph Partitioning in Cloud Data Center." In 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.
Повний текст джерелаYang, Zhiyuan, and Ankur Srivastava. "Co-Placement for Pin-Fin Based Micro-Fluidically Cooled 3D ICs." In 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.
Повний текст джерелаAL-Qahtani, Ghazi D., and Noah Berlow. "Large Scale Placement For Multilateral Wells Using Network Optimization." In SPE Middle East Oil & Gas Show and Conference. SPE, 2021. http://dx.doi.org/10.2118/204803-ms.
Повний текст джерелаVerplaetse, P., J. Dambre, D. Stroobandt, and J. Van Campenhout. "On partitioning vs. placement rent properties." In the 2001 international workshop. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/368640.368665.
Повний текст джерелаRavichandran, Ramprasad, Mike Niemier, and Sung Kyu Lim. "Partitioning and placement for buildable QCA circuits." In the 2005 conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1120725.1120902.
Повний текст джерелаCan Yildiz, Mehmet, and Patrick H. Madden. "Improved cut sequences for partitioning based placement." In the 38th conference. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/378239.379064.
Повний текст джерелаMadden, P. "Session details: Session 4: Partitioning & Placement." In ISPD03: International Symposium on Physical Design. New York, NY, USA: ACM, 2003. http://dx.doi.org/10.1145/3248312.
Повний текст джерелаЗвіти організацій з теми "Partitioning and placement algorithms"
Abou-rjeili, Amine, and George Karypis. Multilevel Algorithms for Partitioning Power-Law Graphs. Fort Belvoir, VA: Defense Technical Information Center, October 2005. http://dx.doi.org/10.21236/ada439402.
Повний текст джерелаSelvakkumaran, Navaratnasothie, Abhishek Ranjan, Salil Raje, and George Karypis. Scalable Partitioning Algorithms for FPGAs With Heterogeneous Resources. Fort Belvoir, VA: Defense Technical Information Center, September 2004. http://dx.doi.org/10.21236/ada439474.
Повний текст джерелаMoulitsas, Irene, and George Karypis. Partitioning Algorithms for Simultaneously Balancing Iterative and Direct Methods. Fort Belvoir, VA: Defense Technical Information Center, March 2004. http://dx.doi.org/10.21236/ada439418.
Повний текст джерелаKashyap, Abhishek, Samir Khuller, and Mark Shayman. Relay Placement Approximation Algorithms for k-Connectivity in Wireless Sensor Networks. Fort Belvoir, VA: Defense Technical Information Center, January 2006. http://dx.doi.org/10.21236/ada455438.
Повний текст джерелаSelvakkumaran, Navaratnasothie, and George Karypis. Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. Fort Belvoir, VA: Defense Technical Information Center, September 2004. http://dx.doi.org/10.21236/ada439471.
Повний текст джерелаSelvakkumaran, Navaratnasothie, and George Karypis. Multi-Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. Fort Belvoir, VA: Defense Technical Information Center, April 2003. http://dx.doi.org/10.21236/ada439577.
Повний текст джерелаLing, Hao. Application of Model-Based Signal Processing and Genetic Algorithms for Shipboard Antenna Design, Placement Optimization. Fort Belvoir, VA: Defense Technical Information Center, January 2002. http://dx.doi.org/10.21236/ada399555.
Повний текст джерелаBanks, Jeffrey. CARPE DIEM: Coupled Algorithms for Robust Partitioning of Equations for the Dynamic Interactions of Evolving Materials. Office of Scientific and Technical Information (OSTI), November 2021. http://dx.doi.org/10.2172/1829714.
Повний текст джерелаIdakwo, Gabriel, Sundar Thangapandian, Joseph Luttrell, Zhaoxian Zhou, Chaoyang Zhang, and 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.), July 2021. http://dx.doi.org/10.21079/11681/41302.
Повний текст джерелаSinclair, Samantha, and Sandra LeGrand. Reproducibility assessment and uncertainty quantification in subjective dust source mapping. Engineer Research and Development Center (U.S.), August 2021. http://dx.doi.org/10.21079/11681/41523.
Повний текст джерела