Gotowa bibliografia na temat „Heuristics”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Heuristics”.
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 "Heuristics"
Seipp, Jendrik. "Better Orders for Saturated Cost Partitioning in Optimal Classical Planning". Proceedings of the International Symposium on Combinatorial Search 8, nr 1 (1.09.2021): 149–53. http://dx.doi.org/10.1609/socs.v8i1.18438.
Pełny tekst źródłaWilt, Christopher, i Wheeler Ruml. "Effective Heuristics for Suboptimal Best-First Search". Journal of Artificial Intelligence Research 57 (31.10.2016): 273–306. http://dx.doi.org/10.1613/jair.5036.
Pełny tekst źródłaSanggala, Ekra, i Muhammad Ardhya Bisma. "Perbandingan Savings Algorithm dengan Nearest Neighbour dalam Menyelesaikan Russian TSP Instances". Jurnal Media Teknik dan Sistem Industri 7, nr 1 (31.03.2023): 27. http://dx.doi.org/10.35194/jmtsi.v7i1.3039.
Pełny tekst źródłaUrsani, Ziauddin, i Ahsan Ahmad Ursani. "Augmented tour construction heuristics for the travelling salesman problem". International Journal of Industrial Optimization 4, nr 2 (11.09.2023): 131–44. http://dx.doi.org/10.12928/ijio.v4i2.7875.
Pełny tekst źródłaShperberg, Shahaf, Ariel Felner, Lior Siag i Nathan R. Sturtevant. "On the Properties of All-Pair Heuristics". Proceedings of the International Symposium on Combinatorial Search 17 (1.06.2024): 127–33. http://dx.doi.org/10.1609/socs.v17i1.31550.
Pełny tekst źródłaDrake, John H., Matthew Hyde, Khaled Ibrahim i Ender Ozcan. "A genetic programming hyper-heuristic for the multidimensional knapsack problem". Kybernetes 43, nr 9/10 (3.11.2014): 1500–1511. http://dx.doi.org/10.1108/k-09-2013-0201.
Pełny tekst źródłaSeipp, Jendrik, Florian Pommerening i Malte Helmert. "New Optimization Functions for Potential Heuristics". Proceedings of the International Conference on Automated Planning and Scheduling 25 (8.04.2015): 193–201. http://dx.doi.org/10.1609/icaps.v25i1.13714.
Pełny tekst źródłaNarayanan, Venkatraman, Sandip Aine i Maxim Likhachev. "Improved Multi-Heuristic A* for Searching with Uncalibrated Heuristics". Proceedings of the International Symposium on Combinatorial Search 6, nr 1 (1.09.2021): 78–86. http://dx.doi.org/10.1609/socs.v6i1.18350.
Pełny tekst źródłaShanklin, Roslyn, Philip Kortum i Claudia Ziegler Acemyan. "Adaptation of Heuristic Evaluations for the Physical Environment". Proceedings of the Human Factors and Ergonomics Society Annual Meeting 64, nr 1 (grudzień 2020): 1135–39. http://dx.doi.org/10.1177/1071181320641272.
Pełny tekst źródłaPommerening, Florian, Gabriele Röger, Malte Helmert i Blai Bonet. "LP-Based Heuristics for Cost-Optimal Planning". Proceedings of the International Conference on Automated Planning and Scheduling 24 (11.05.2014): 226–34. http://dx.doi.org/10.1609/icaps.v24i1.13621.
Pełny tekst źródłaRozprawy doktorskie na temat "Heuristics"
Peake, Katharine Louise. "Composition heuristics and theories and a proposed heuristic for business writing". CSUSB ScholarWorks, 2007. https://scholarworks.lib.csusb.edu/etd-project/3282.
Pełny tekst źródłaMonk, Monika Patrice. "Mobile Exergaming Heuristics". Thesis, Virginia Tech, 2014. http://hdl.handle.net/10919/50581.
Pełny tekst źródłaMaster of Science
Yee, Michael 1978. "Inferring noncompensatory choice heuristics". Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36226.
Pełny tekst źródłaIncludes bibliographical references (p. 121-128).
Human decision making is a topic of great interest to marketers, psychologists, economists, and others. People are often modeled as rational utility maximizers with unlimited mental resources. However, due to the structure of the environment as well as cognitive limitations, people frequently use simplifying heuristics for making quick yet accurate decisions. In this research, we apply discrete optimization to infer from observed data if a person is behaving in way consistent with a choice heuristic (e.g., a noncompensatory lexicographic decision rule). We analyze the computational complexity of several inference related problems, showing that while some are easy due to possessing a greedoid language structure, many are hard and likely do not have polynomial time solutions. For the hard problems we develop an exact dynamic programming algorithm that is robust and scalable in practice, as well as analyze several local search heuristics. We conduct an empirical study of SmartPhone preferences and find that the behavior of many respondents can be explained by lexicographic strategies.
(cont.) Furthermore, we find that lexicographic decision rules predict better on holdout data than some standard compensatory models. Finally, we look at a more general form of noncompensatory decision process in the context of consideration set formation. Specifically, we analyze the computational complexity of rule-based consideration set formation, develop solution techniques for inferring rules given observed consideration data, and apply the techniques to a real dataset.
by Michael J. Yee.
Ph.D.
Panthulu, Pradeep. "Intelligent Memory Management Heuristics". Thesis, University of North Texas, 2003. https://digital.library.unt.edu/ark:/67531/metadc4399/.
Pełny tekst źródłaPetracca, Enrico <1983>. "Essays in structural heuristics". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amsdottorato.unibo.it/6284/1/Petracca_Enrico_Tesi.pdf.
Pełny tekst źródłaPetracca, Enrico <1983>. "Essays in structural heuristics". Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amsdottorato.unibo.it/6284/.
Pełny tekst źródłaClark, Andrew J. "Optimisation heuristics for cryptology". Thesis, Queensland University of Technology, 1998. https://eprints.qut.edu.au/15777/1/Andrew_Clark_Thesis.pdf.
Pełny tekst źródłaClark, Andrew J. "Optimisation Heuristics for Cryptology". Queensland University of Technology, 1998. http://eprints.qut.edu.au/15777/.
Pełny tekst źródłaLü, Haili, i 吕海利. "A comparative study of assembly job shop scheduling using simulation, heuristics and meta-heuristics". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B47029018.
Pełny tekst źródłaPasch, Kenneth Alan. "Heuristics for Job-Shop Scheduling". Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/6847.
Pełny tekst źródłaKsiążki na temat "Heuristics"
Osman, Ibrahim H., i James P. Kelly, red. Meta-Heuristics. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1361-8.
Pełny tekst źródłaB, Fogel David, red. How to solve it: Modern heuristics. Wyd. 2. Berlin: Springer, 2004.
Znajdź pełny tekst źródłaAndre, Carlos, Reis Pinheiro i Fiona McNeill, red. Heuristics in Analytics. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2012. http://dx.doi.org/10.1002/9781118434260.
Pełny tekst źródłaMartí, Rafael, Pardalos Panos i Mauricio G. C. Resende, red. Handbook of Heuristics. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-07153-4.
Pełny tekst źródłaThe heuristics debate. Oxford: Oxford University Press, 2011.
Znajdź pełny tekst źródłaB, Fogel David, red. How to solve it: Modern heuristics. Berlin: Springer, 2000.
Znajdź pełny tekst źródłaGigerenzer, Gerd. Simple heuristics that make us smart. New York: Oxford University Press, 1999.
Znajdź pełny tekst źródłaObject-oriented design heuristics. Reading, Mass: Addison-Wesley Pub. Co., 1996.
Znajdź pełny tekst źródłaHartman, Jan. Heurystyka filozoficzna: Philosophical heuristics. Toruń: Wydawnictwo Naukowe Uniwersytetu Mikołaja Kopernika, 2011.
Znajdź pełny tekst źródłaChatfield, Tom, i Tom Chatfield. Heuristics and Cognitive Biases. 2455 Teller Road, Thousand Oaks California 91320: SAGE Publications, Inc., 2022. http://dx.doi.org/10.4135/9781071880029.
Pełny tekst źródłaCzęści książek na temat "Heuristics"
Pirrone, Angelo, Peter C. R. Lane, Laura Bartlett, Noman Javed i Fernand Gobet. "Heuristic Search of Heuristics". W Artificial Intelligence XL, 407–20. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-47994-6_36.
Pełny tekst źródłaBard, Jonathan F. "Heuristics". W Nonconvex Optimization and Its Applications, 361–88. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4757-2836-1_9.
Pełny tekst źródłaMeyn, Sean P., i Richard L. Tweedie. "Heuristics". W Markov Chains and Stochastic Stability, 3–22. London: Springer London, 1993. http://dx.doi.org/10.1007/978-1-4471-3267-7_1.
Pełny tekst źródłaFortz, Bernard. "Heuristics". W Network Theory and Applications, 115–23. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4669-6_7.
Pełny tekst źródłaLaguna, Manuel, i Rafael Martí. "Heuristics". W Encyclopedia of Operations Research and Management Science, 695–703. Boston, MA: Springer US, 2013. http://dx.doi.org/10.1007/978-1-4419-1153-7_1184.
Pełny tekst źródłaGonzales, Josh, i Sandeep Mishra. "Heuristics". W Encyclopedia of Evolutionary Psychological Science, 1–3. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-16999-6_626-1.
Pełny tekst źródłaRubaltelli, Enrico. "Heuristics". W The Palgrave Encyclopedia of the Possible, 1–9. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-98390-5_1-1.
Pełny tekst źródłaLi, PhD, Haksun. "Heuristics". W Numerical Methods Using Kotlin, 473–94. Berkeley, CA: Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-8826-9_11.
Pełny tekst źródłaHromkovič, Juraj. "Heuristics". W Texts in Theoretical Computer Science An EATCS Series, 387–415. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04616-6_6.
Pełny tekst źródłaHromkovič, Juraj. "Heuristics". W Texts in Theoretical Computer Science. An EATCS Series, 431–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-05269-3_6.
Pełny tekst źródłaStreszczenia konferencji na temat "Heuristics"
Hitomi, Nozomi, i Daniel Selva. "The Effect of Credit Definition and Aggregation Strategies on Multi-Objective Hyper-Heuristics". W ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-47445.
Pełny tekst źródłaTrevizan, Felipe, Sylvie Thiébaux i Patrik Haslum. "Operator Counting Heuristics for Probabilistic Planning". W Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/758.
Pełny tekst źródłaWichlacz, Julia, Daniel Höller i Jörg Hoffmann. "Landmark Heuristics for Lifted Classical Planning". W Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/647.
Pełny tekst źródłaRenan de Carvalho, Vinicius, i Jaime Simão Sichman. "Multi-Agent Election-Based Hyper-Heuristics". W Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/833.
Pełny tekst źródłaPuentes, Lucas, Jonathan Cagan i Christopher McComb. "Automated Heuristic Induction From Human Design Data". W ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22151.
Pełny tekst źródłaSteinmetz, Marcel, i Joerg Hoffmann. "LP Heuristics over Conjunctions: Compilation, Convergence, Nogood Learning". W Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/672.
Pełny tekst źródłaMischek, Florian, i Nysret Musliu. "Reinforcement Learning for Cross-Domain Hyper-Heuristics". W Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/664.
Pełny tekst źródłaInterian, Yannet, i Sara Bernardini. "Learning Interpretable Heuristics for WalkSAT". W 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/36.
Pełny tekst źródłaHu, Shuli, i Nathan R. Sturtevant. "Direction-Optimizing Breadth-First Search with External Memory Storage". W Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/175.
Pełny tekst źródłaFan, Gaojian, Martin Müller i Robert Holte. "Additive Merge-and-Shrink Heuristics for Diverse Action Costs". W Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/599.
Pełny tekst źródłaRaporty organizacyjne na temat "Heuristics"
Franklin, R., i L. Harmon. Heuristics for Cooperative Problem Solving. Fort Belvoir, VA: Defense Technical Information Center, luty 1989. http://dx.doi.org/10.21236/ada206371.
Pełny tekst źródłaPasch, Kenneth A. Heuristics for Job-Shop Scheduling. Fort Belvoir, VA: Defense Technical Information Center, styczeń 1988. http://dx.doi.org/10.21236/ada198192.
Pełny tekst źródłaKivinen, T., i D. McDonald. Heuristics for Detecting ESP-NULL Packets. RFC Editor, maj 2010. http://dx.doi.org/10.17487/rfc5879.
Pełny tekst źródłaSimon, Luke. Visualization for Hyper-Heuristics: Back-End Processing. Office of Scientific and Technical Information (OSTI), marzec 2015. http://dx.doi.org/10.2172/1177600.
Pełny tekst źródłaHooker, John N. Combining AI and OR in Heuristics and Optimization. Fort Belvoir, VA: Defense Technical Information Center, grudzień 1997. http://dx.doi.org/10.21236/ada387176.
Pełny tekst źródłaKroenung, Lauren. Visualization for Hyper-Heuristics: Front-End Graphical User Interface. Office of Scientific and Technical Information (OSTI), marzec 2015. http://dx.doi.org/10.2172/1177598.
Pełny tekst źródłaHarris, Sean. A Comparison of Genetic Programming Variants for Hyper-Heuristics. Office of Scientific and Technical Information (OSTI), marzec 2015. http://dx.doi.org/10.2172/1177599.
Pełny tekst źródłaHughes, Jesse B. Hyper-Heuristics to Automatically Target Code to Computer Architectures. Office of Scientific and Technical Information (OSTI), marzec 2016. http://dx.doi.org/10.2172/1618239.
Pełny tekst źródłaMcBride, Dorothy J., i Clifford E. Brown. Team Performance in Dynamic Decision Making: The Importance of Heuristics. Fort Belvoir, VA: Defense Technical Information Center, luty 1989. http://dx.doi.org/10.21236/ada209618.
Pełny tekst źródłaBixby, Robert E., i Robert Fourer. Finding Embedded Network Rows in Linear Programs I: Extraction Heuristics. Fort Belvoir, VA: Defense Technical Information Center, sierpień 1986. http://dx.doi.org/10.21236/ada455195.
Pełny tekst źródła