Gotowe bibliografie tematyczne / Simulated annealing

Gotowa bibliografia na temat „Simulated annealing”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Simulated annealing”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Simulated annealing"

1

Fabian, V. "Simulated annealing simulated". Computers & Mathematics with Applications 33, nr 1-2 (styczeń 1997): 81–94. http://dx.doi.org/10.1016/s0898-1221(96)00221-0.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Tovey, Craig A. "Simulated Simulated Annealing". American Journal of Mathematical and Management Sciences 8, nr 3-4 (luty 1988): 389–407. http://dx.doi.org/10.1080/01966324.1988.10737246.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Bonilla-Petriciolet, Adrián, Juan Carlos Tapia-Picazo, Carlos Soto-Becerra i Javier Gerson Zapiain-Salinas. "Perfiles de comportamiento numérico de los métodos estocásticos simulated annealing y very fast simulated annealing en cálculos termodinámicos". Ingeniería, investigación y tecnología 12, nr 1 (1.01.2011): 51–62. http://dx.doi.org/10.22201/fi.25940732e.2011.12n1.006.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

KITA, Hajime. "Simulated Annealing". Journal of Japan Society for Fuzzy Theory and Systems 9, nr 6 (1997): 870–75. http://dx.doi.org/10.3156/jfuzzy.9.6_870.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Bertsimas, Dimitris, i John Tsitsiklis. "Simulated Annealing". Statistical Science 8, nr 1 (luty 1993): 10–15. http://dx.doi.org/10.1214/ss/1177011077.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Johnson, Mark E. "Simulated Annealing". American Journal of Mathematical and Management Sciences 8, nr 3-4 (luty 1988): 205–7. http://dx.doi.org/10.1080/01966324.1988.10737241.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Bhattacharya, Arijit, Sayantan Ghatak, Rajib Das i Satrajit Ghosh. "Simulated Annealing Approach onto VLSI Circuit Partitioning". Mathematical Journal of Interdisciplinary Sciences 2, nr 2 (3.03.2014): 133–39. http://dx.doi.org/10.15415/mjis.2014.22010.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Hamma, Beidi, Sami Viitanen i Aimo Törn. "Parallel continuous simulated annealing for global optimization simulated annealing∗". Optimization Methods and Software 13, nr 2 (styczeń 2000): 95–116. http://dx.doi.org/10.1080/10556780008805777.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

O. H. Abdelwahed, O. H. Abdelwahed, i M. El-Sayed Wahed. "Optimizing Single Layer Cellular Neural Network Simulator using Simulated Annealing Technique with Neural Networks". Indian Journal of Applied Research 3, nr 6 (1.10.2011): 91–94. http://dx.doi.org/10.15373/2249555x/june2013/31.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Kallab, Chadi, Samir Haddad, Jinane Sayah i Mohamad Chakroun. "Generic Simulated Annealing". Open Journal of Applied Sciences 12, nr 06 (2022): 1011–25. http://dx.doi.org/10.4236/ojapps.2022.126069.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Simulated annealing"

1

Araujo, Haroldo Alexandre de. "Algoritmo Simulated Annealing". Florianópolis, SC, 2001. http://repositorio.ufsc.br/xmlui/handle/123456789/80386.

Pełny tekst źródła
Streszczenie:
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação.
Made available in DSpace on 2012-10-18T13:35:55Z (GMT). No. of bitstreams: 1 225675.pdf: 796704 bytes, checksum: 892abc8468e4e7c6715b6c3f2de50e51 (MD5)
A busca por soluções de problemas por meio do computador é o tema central da ciência da computação, relevante para grande parte da ciência e de suas aplicações tecnológicas. Essa busca, certamente, vai na direção de algoritmos eficientes e exatos mas que nem sempre boas soluções podem ser encontradas para muitos problemas de ordem prática, principalmente, no que diz respeito a tempo de execução. Existem problemas, dentre estes, os de otimização combinatorial que apresentam uma peculiaridade com relação aos outros, que é a grande dificuldade de se obter soluções exatas num tempo computacional aceitável. Atualmente, as novas técnicas, especialmente as metaheurísticas, tais como: Tabu Search, Simulated Annealing, Algoritmos Genéticos e Redes Neurais, vêm conseguindo sucesso na solução de problemas de otimização combinatorial, que mesmo não apresentando soluções exatas têm mostrado bastante eficiência com suas soluções aproximadas. Este trabalho propõe um novo método baseado no algoritmo Simulated Annealing (SA) através de mudanças bruscas nos valores da temperatura que são retiradas de múltiplas faixas, ao contrário do SA básico, onde esses valores são obtidos de uma faixa única, ou seja, num SA básico, os valores assumidos pela temperatura saem de um intervalo, partindo de um valor inicial, e vão diminuindo até um valor final. Tais mudanças bruscas acontecem exatamente no momento da mudança de faixa, pois o valor da temperatura que no final de uma faixa é pequeno, assume um valor correspondente a temperatura inicial da faixa seguinte, normalmente, bem maior. Posto a prova, com instâncias euclidianas do Problema Caixeiro Viajante, que é um problema de otimização combinatorial de difícil solução, o método apresenta resultados bastante satisfatórios quando comparado com o SA básico.
Style APA, Harvard, Vancouver, ISO itp.
2

Sakhavat, Tamim, Haithem Grissa i Ziyad Abdalrahman. "Simulated Annealing : Simulated Annealing for Large Scale Optimization in Wireless Communications". Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-24606.

Pełny tekst źródła
Streszczenie:
In this thesis a simulated annealing algorithm is employed as an optimization tool for a large scale optimization problem in wireless communication. In this application, we have 100 places for transition antennas and 100 places for receivers, and also a channel between each position in both areas. Our aim is to nd, say the best 3 positions there, in a way that the channel capacity is maximized. The number of possible combinations is huge. Hence, nding the best channel will take a very long time using an exhaustive search. To solve this problem, we use a simulated annealing algorithm and estimate the best answer. The simulated annealing algorithm chooses a random element, and then from the local search algorithm, compares the selected element with its neighbourhood. If the selected element is the maximum among its neighbours, it is a local maximum. The strength of the simulated annealing algorithm is its ability to escape from local maximum by using a random mechanism that mimics the Boltzmann statistic.
Style APA, Harvard, Vancouver, ISO itp.
3

Thompson, J. M. "Examination scheduling using simulated annealing". Thesis, Swansea University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.639229.

Pełny tekst źródła
Streszczenie:
Recent increases, both in student numbers and choice of subjects, have made the problem of producing university examination timetables increasingly difficult. Additionally, there is pressure to give students free periods between exams to aid their revision. Many other constraints may also be imposed on the timetable. The aim of this research is to investigate the usefulness of simulated annealing, as a basis of an efficient solution method, for this problem. The examination timetabling problem is shown to be equivalent to the graph colouring problem, with side constraints. This model allows several of the constraints to be included directly, thereby simplifying the problem. The colouring problem is solved in two phases, with the first obtaining a feasible colouring and the second optimising further objectives while maintaining feasibility. Simulated annealing is used to solve each phase and computational experience demonstrates that this results in high quality solutions. In phase two, only feasible solutions, that is those which satisfy the binding constraints, are considered. This may result in the solution space being disconnected or sparsely connected, possibly reducing solution quality. To overcome this problem, three means of reconnecting the solution space have been developed. The first widens the neighbourhood to include more diverse solutions. The second attempts to search disjoint components of the solution space individually, using a diversification function to guide the search. The final method reintroduces solutions that break the binding constraints to the solution space while penalising them in the cost function. Extending the neighbourhood using a graph theoretic entity called a Kempe chain significantly increases solution quality. Several explanations have been investigated. This research shows that a combination of a phased approach and Kempe chains forms the basis of an effective and flexible simulated annealing based examination timetabling system, which has been implemented successfully at a U.K. university.
Style APA, Harvard, Vancouver, ISO itp.
4

Neil, John Paul. "Simulated annealing based datapath synthesis". Thesis, University of Edinburgh, 1994. http://hdl.handle.net/1842/12715.

Pełny tekst źródła
Streszczenie:
The behavioural synthesis procedure aims to produce optimised register-transfer level datapath descriptions from an algorithmic problem definition, normally expressed in a high-level programming language. The procedure can be partitioned into a number of subtasks linked by a serial synthesis flow. Graph theoretic algorithms can be used to provide solutions to these subtasks. Many of these techniques, however, belong to a class of algorithm for which there is no exact solution computable in polynomial time. To overcome this problem, heuristics are used to constrain the solution space. The introduction of heuristics can cause the algorithm to terminate in a local cost minimum. This thesis supports a global formulation of the behavioural synthesis problem. An algorithm which can avoid local minima, simulated annealing forms the basis of the synthesis system reported. A modular software system is presented in support of this approach. A novel data structure enables multiple degrees of optimisation freedom within the datapath solution space. Synthesis primitives, tightly coupled to a solution costing mechanism directed towards the prevalent datapath implementation technologies, form the core of the system. The software is exercised over small and large-scale synthesis benchmarks. The synthesis paradigm is extended by the provision of optimisation routines capable of supporting the generation of functional pipelines.
Style APA, Harvard, Vancouver, ISO itp.
5

Cevikbas, Safak Burak. "Visibility Based Prefetching With Simulated Annealing". Master's thesis, METU, 2008. http://etd.lib.metu.edu.tr/upload/12609324/index.pdf.

Pełny tekst źródła
Streszczenie:
Complex urban scene rendering is not feasible without culling invisible geometry before the rendering actually takes place. Visibility culling can be performed on predefined regions of scene where for each region a potential visible set of scene geometry is computed. Rendering cost is reduced since instead of a bigger set only a single PVS which is associated with the region of the viewer is rendered. However, when the viewer leaves a region and enters one of its neighbors, disposing currently loaded PVS and loading the new PVS causes stalls. Prefetching policies are utilized to overcome stalls by loading PVS of a region before the viewer enters it. This study presents a prefetching method for interactive urban walkthroughs. Regions and transitions among them are represented as a graph where the regions are the nodes and transitions are the edges. Groups of nodes are formed according to statistical data of transitions and used as the prefetching policy. Some heuristics for constructing groups of nodes are developed and Simulated Annealing is utilized for constructing optimized groups based on developed heuristics. The proposed method and underlying application of Simulated Annealing are customized for minimizing average transition cost.
Style APA, Harvard, Vancouver, ISO itp.
6

Färm, Petra. "Integrated Logic Synthesis Using Simulated Annealing". Doctoral thesis, KTH, Mikroelektronik och Informationsteknik, IMIT, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4257.

Pełny tekst źródła
Streszczenie:
A conventional logic synthesis flow is composed of three separate phases: technologyindependent optimization, technology mapping, and technology dependentoptimization. A fundamental problem with such a three-phased approach is thatthe global logic structure is decided during the first phase without any knowledge ofthe actual technology parameters considered during later phases. Although technologydependent optimization algorithms perform some limited logic restructuring,they cannot recover from fundamental mistakes made during the first phase, whichoften results in non-satisfiable solutions.We present a global optimization approach combining technology independentoptimization steps with technology dependent objectives in an annealing-basedframework. We prove that, for the presented move set and selection distribution, detailedbalance is satisfied and thus the annealing process asymptotically convergesto an optimal solution. Furthermore, we show that the presented approach cansmoothly trade-off complex, multiple-dimensional objective functions and achievecompetitive results. The combination of technology independent and technologydependent objectives is handled through dynamic weighting. Dynamic weightingreflects the sensitivity of the local graph structures with respect to the actual technologyparameters such as gate sizes, delays, and power levels. The results showthat, on average, the presented advanced annealing approach can improve the areaand delay of circuits optimized using the Boolean optimization technique providedby SIS with 11.2% and 32.5% respectively.Furthermore, we demonstrate how the developed logic synthesis framework canbe applied to two emerging technologies, chemically assembled nanotechnology andmolecule cascades. New technologies are emerging because a number of physicaland economic factors threaten the continued scaling of CMOS devices. Alternativesto silicon VLSI have been proposed, including techniques based on molecularelectronics, quantum mechanics, and biological processes. We are hoping that ourresearch in how to apply our developed logic synthesis framework to two of theemerging technologies might provide useful information for other designers movingin this direction.
QC 20100709
Style APA, Harvard, Vancouver, ISO itp.
7

Allred, Kory J. "Horizontal alignment optimization using simulated annealing /". Available to subscribers only, 2006. http://proquest.umi.com/pqdweb?did=1240703751&sid=3&Fmt=2&clientId=1509&RQT=309&VName=PQD.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Faassen, Johannes [Verfasser]. "Voll datenparalleles Simulated Annealing / Johannes Faassen". Aachen : Shaker, 2003. http://d-nb.info/1179034473/34.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Wade, A. S. C. "Developments of the simulated annealing algorithm". Thesis, University of East Anglia, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300076.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Zhou, Guobiao. "Finite time performance of simulated annealing". Thesis, Glasgow Caledonian University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358284.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Simulated annealing"

1

Vidal, René V. V., red. Applied Simulated Annealing. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-46787-5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Valqui, Vidal René Victor, red. Applied simulated annealing. Berlin: Springer-Verlag, 1993.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Robert, Azencott, red. Simulated annealing: Parallelization techniques. New York: Wiley, 1992.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Jerrum, Mark. Simulated annealing for graph bisection. Edinburgh: LFCS, Dept. of Computer Science, University of Edinburgh, 1993.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

L, Aarts E. H., red. Simulated annealing: Theory and applications. Dordrecht: D. Reidel, 1987.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

van Laarhoven, Peter J. M., i Emile H. L. Aarts. Simulated Annealing: Theory and Applications. Dordrecht: Springer Netherlands, 1987. http://dx.doi.org/10.1007/978-94-015-7744-1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Wong, D. F., H. W. Leong i C. L. Liu. Simulated Annealing for VLSI Design. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4613-1677-0.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Laarhoven, Peter J. M. Simulated Annealing: Theory and Applications. Dordrecht: Springer Netherlands, 1987.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Lawrence, Davis, red. Genetic algorithms and simulated annealing. London: Pitman, 1987.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Wong, D. F. Simulated annealing for VLSI design. Boston: Kluwer Academic, 1988.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Simulated annealing"

1

Du, Ke-Lin, i M. N. S. Swamy. "Simulated Annealing". W Search and Optimization by Metaheuristics, 29–36. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41192-7_2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Čepin, Marko. "Simulated Annealing". W Assessment of Power System Reliability, 271–75. London: Springer London, 2011. http://dx.doi.org/10.1007/978-0-85729-688-7_19.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Aarts, Emile, Jan Korst i Wil Michiels. "Simulated Annealing". W Search Methodologies, 265–85. Boston, MA: Springer US, 2013. http://dx.doi.org/10.1007/978-1-4614-6940-7_10.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Nikolaev, Alexander G., i Sheldon H. Jacobson. "Simulated Annealing". W Handbook of Metaheuristics, 1–39. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-1665-5_1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Dowsland, Kathryn A., i Jonathan M. Thompson. "Simulated Annealing". W Handbook of Natural Computing, 1623–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-540-92910-9_49.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Aarts, E., P. van der Horn, J. Korst, W. Michiels i H. Sontrop. "Simulated Annealing". W Metaheuristic Procedures for Training Neutral Networks, 37–52. Boston, MA: Springer US, 2006. http://dx.doi.org/10.1007/0-387-33416-5_2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Awange, Joseph L., Béla Paláncz, Robert H. Lewis i Lajos Völgyesi. "Simulated Annealing". W Mathematical Geosciences, 113–36. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-67371-4_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Wang, Sun-Chong. "Simulated Annealing". W Interdisciplinary Computing in Java Programming, 59–79. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0377-4_4.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Siarry, Patrick. "Simulated Annealing". W Metaheuristics, 19–50. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45403-0_2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

van Laarhoven, Peter J. M., i Emile H. L. Aarts. "Simulated annealing". W Simulated Annealing: Theory and Applications, 7–15. Dordrecht: Springer Netherlands, 1987. http://dx.doi.org/10.1007/978-94-015-7744-1_2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Simulated annealing"

1

Fleischer, Mark. "Simulated annealing". W the 27th conference. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/224401.224457.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Carvalho, Vinícius Nunes, i Sezimária de Fátima Pereira Saramago. "IMPROVED SIMULATED ANNEALING". W Congresso Nacional de Matemática Aplicada à Indústria. São Paulo: Editora Edgard Blücher, 2015. http://dx.doi.org/10.5151/mathpro-cnmai-0041.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Szu, Harold. "Fast simulated annealing". W AIP Conference Proceedings Volume 151. AIP, 1986. http://dx.doi.org/10.1063/1.36250.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Singh, Nishant, i Bahniman Ghosh. "Simulated annealing Vs. Genetic Simulated Annealing for automatic transistor sizing". W 2012 10th IEEE International Conference on Semiconductor Electronics (ICSE). IEEE, 2012. http://dx.doi.org/10.1109/smelec.2012.6417190.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Crosson, Elizabeth, i Aram W. Harrow. "Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing". W 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2016. http://dx.doi.org/10.1109/focs.2016.81.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Kerrache, Said, i Hafida Benhidour. "Topology-Aware Simulated Annealing". W 2014 2nd International Conference on Artificial Intelligence, Modelling & Simulation (AIMS). IEEE, 2014. http://dx.doi.org/10.1109/aims.2014.49.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Nahar, Surendra, Sartaj Sahni i Eugene Shragowitz. "Experiments with simulated annealing". W the 22nd ACM/IEEE conference. New York, New York, USA: ACM Press, 1985. http://dx.doi.org/10.1145/317825.317977.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Nahar, S., S. Sahni i E. Shragowitz. "Experiments with Simulated Annealing". W 22nd ACM/IEEE Design Automation Conference. IEEE, 1985. http://dx.doi.org/10.1109/dac.1985.1586028.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Cook, Rod, Ian McConnell, David Stewart i Christopher J. Oliver. "Segmentation and simulated annealing". W Satellite Remote Sensing III, redaktorzy Giorgio Franceschetti, Christopher J. Oliver, Franco S. Rubertone i Shahram Tajbakhsh. SPIE, 1996. http://dx.doi.org/10.1117/12.262709.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Esmailzadeh, A., i S. Rahnamayan. "Center-point-based Simulated Annealing". W 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering (CCECE). IEEE, 2012. http://dx.doi.org/10.1109/ccece.2012.6334976.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Simulated annealing"

1

Bandyopadhyay, S., S. K. Pal i C. A. Murthy. Simulated Annealing Based Pattern Classification. Fort Belvoir, VA: Defense Technical Information Center, maj 1998. http://dx.doi.org/10.21236/ada358039.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Cole, James B., i David H. Gerstman. Image Recovery by Simulated Annealing. Fort Belvoir, VA: Defense Technical Information Center, listopad 1990. http://dx.doi.org/10.21236/ada230655.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Rose, Jonathan, Wolfgang Klebsch i Juergen Wolf. Temperature Measurement of Simulated Annealing Placements. Fort Belvoir, VA: Defense Technical Information Center, styczeń 1987. http://dx.doi.org/10.21236/ada207229.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Gelfand, Saul B., i Sanjoy K. Mitter. Analysis of Simulated Annealing for Optimization. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 1985. http://dx.doi.org/10.21236/ada170174.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Gelfand, Saul B., i Sanjoy K. Mitter. Simulated Annealing Type Algorithms for Multivariate Optimization. Fort Belvoir, VA: Defense Technical Information Center, styczeń 1989. http://dx.doi.org/10.21236/ada460156.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Fleischer, Mark, i Sheldon Jacobson. Scale Invariance Properties in the Simulated Annealing Algorithm. Fort Belvoir, VA: Defense Technical Information Center, styczeń 2002. http://dx.doi.org/10.21236/ada442644.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Tsitsiklis, John N. Markov Chains with Rare Transitions and Simulated Annealing. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 1985. http://dx.doi.org/10.21236/ada161598.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Rose, Jonathan, Wolfgang Klebsch i Juergen Wolf. Temperature Measurement and Equilibrium Dynamics of Simulated Annealing Placements. Fort Belvoir, VA: Defense Technical Information Center, styczeń 1987. http://dx.doi.org/10.21236/ada207230.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Nakao, Shinsuke, J. Najita i Kenzi Karasaki. Sensitivity study on hydraulic well testing inversion using simulated annealing. Office of Scientific and Technical Information (OSTI), listopad 1997. http://dx.doi.org/10.2172/658166.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Yildirim, Cem, Jon T. Butler i Chyan Yang. Multiple-Valued PLA Minimization by Concurrent Multiple and Mixed Simulated Annealing. Fort Belvoir, VA: Defense Technical Information Center, maj 1993. http://dx.doi.org/10.21236/ada605412.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Simulated annealing” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii