Gotowa bibliografia na temat „Heuristic research”
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 „Heuristic research”.
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 "Heuristic research"
Hyatt, Robert P. "Heuristic Research". Tradition and Discovery: The Polanyi Society Periodical 38, nr 3 (2011): 71–74. http://dx.doi.org/10.5840/traddisc2011/201238329.
Pełny tekst źródłaLiang, Rui Shi, i Min Huang. "Heuristics for Domain-Independent Planning: A Survey". Applied Mechanics and Materials 135-136 (październik 2011): 573–77. http://dx.doi.org/10.4028/www.scientific.net/amm.135-136.573.
Pełny tekst źródłaSavolainen, Reijo. "Heuristics elements of information-seeking strategies and tactics: a conceptual analysis". Journal of Documentation 73, nr 6 (9.10.2017): 1322–42. http://dx.doi.org/10.1108/jd-11-2016-0144.
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ł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łaUrsani, Ziauddin, i David W. Corne. "Introducing Complexity Curtailing Techniques for the Tour Construction Heuristics for the Travelling Salesperson Problem". Journal of Optimization 2016 (2016): 1–15. http://dx.doi.org/10.1155/2016/4786268.
Pełny tekst źródłaÖzcan, Ender, Mustafa Misir, Gabriela Ochoa i Edmund K. Burke. "A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling". International Journal of Applied Metaheuristic Computing 1, nr 1 (styczeń 2010): 39–59. http://dx.doi.org/10.4018/jamc.2010102603.
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łaHIGGINS, A. J. "A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS". Asia-Pacific Journal of Operational Research 22, nr 02 (czerwiec 2005): 171–88. http://dx.doi.org/10.1142/s0217595905000492.
Pełny tekst źródłaGoldenberg, Meir. "The Heuristic Search Research Framework". Knowledge-Based Systems 129 (sierpień 2017): 1–3. http://dx.doi.org/10.1016/j.knosys.2017.05.009.
Pełny tekst źródłaRozprawy doktorskie na temat "Heuristic research"
Rolland, Erik. "Abstract heuristic search methods for graph partitioning". Connect to resource, 1991. http://rave.ohiolink.edu/etdc/view.cgi?acc%5Fnum=osu1262633923.
Pełny tekst źródłaAKSAKALLI, VURAL. "Heuristic Methods for Gang-Rip Saw Arbor Design and Scheduling". NCSU, 1999. http://www.lib.ncsu.edu/theses/available/etd-19991102-031914.
Pełny tekst źródłaAKSAKALLI, VURAL. Heuristic Methods for Gang-Rip Saw Arbor Design and Scheduling. (Under the direction of Dr. Yahya Fathi).This research considers the problem of designing and scheduling arbors for gang-rip saw systems. Such systems are typically used within the furniture manufacturing industry for processing lumber, where lumber boards are first ripped lengthwise into strips of different widths, and then, cut to the required lengths to be used in manufacturing.A saw with multiple cutting channels is used to perform this operation. This saw has fixed blades at specific positions on a rotating shaft which rips incoming lumber boards into required finished widths. The pattern of cutting channels (i.e., the setting of the blades) along the saw shaft is referred to as an ''arbor''.A typical instance of the problem consists of (1) a set of required finished widths and their corresponding demands, (2) a frequency distribution of lumber boards in the uncut stock, (3) a shaft length, and (4) a blade width. The objective is to design a set of (one or more) arbors and the corresponding quantity of lumber to run through each arbor, such that the total amount of waste generated is minimized while the demand is satisfied.In the research, we focus on solving the problem using only one arbor. First, we discuss the computational complexity of the problem and propose a total enumeration procedure which can be used to solve relatively small instances. Then, we develop algorithms based on heuristic approaches such as local improvement procedures, simulated annealing, and genetic algorithms. Our computational experiments indicate that a local improvement procedure with two nested loops, performing local search with a different neighborhood structure within each loop, gives very high quality solutions to the problem within very short execution times.
Höck, Barbar Katja. "An examination of heuristic algorithms for the travelling salesman problem". Master's thesis, University of Cape Town, 1988. http://hdl.handle.net/11427/22268.
Pełny tekst źródłaMaye, P. J. "Exact and heuristic methods of finding network structure in linear programs". Thesis, Coventry University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.276165.
Pełny tekst źródłaAsgharzadeh, Talebi Zohreh. "Exact and Heuristic Methods for solving the View-Selection Problem for Aggregate Queries". NCSU, 2006. http://www.lib.ncsu.edu/theses/available/etd-05092006-123513/.
Pełny tekst źródłaSamson, Duncan Alistair. "The heuristic significance of enacted visualisation". Thesis, Rhodes University, 2012. http://hdl.handle.net/10962/d1003434.
Pełny tekst źródłaKhambhampati, Surya Sudha. "A Tabu Search Heuristic for Multi-Period Clustering to Rationalize Delivery Operations". Wright State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=wright1210959864.
Pełny tekst źródłaShah, Mahesh. "A heuristic method for the optimal design of water distribution systems". Thesis, Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/88600.
Pełny tekst źródłaMaster of Science
Cain, Mark J. "A GAMS-based model of the U.S. Army Wartime Ammunition Distribution System for the Corps level". Thesis, Monterey, California. Naval Postgraduate School, 1985. http://hdl.handle.net/10945/23244.
Pełny tekst źródłaThe U.S. Army Wartime Ammunition Distribution System (WADS) will experience an unprecedented demand for ammunition under the operational concept of Airland Battle. To meet demand, proper storage facility location and an efficient flow through the distribution network will be required. Using information from Army Field Manuals, maps and simulation data for demand, both a mixed integer program (MIP) and a sequential, optimization-based heuristic are developed to model the WADS. The Generalized Algebraic Modelling System is used to implement both models. The sequential heuristic locates ammunition facilities with a binary integer program and then directs ammunition through those facilities utilizing a network flow model with side constraints. The MIP integrates location and flow decisions in the same model. For a general scenario, the sequential heuristic locates a 21 node, 30 arc network with ammunition flows over 30 time periods in 22 CPU seconds on an IBM 3033AP. For the same scenario the MIP obtains a solution for only a 3 time period problem in 87 CPU seconds. Keywords: Ammunition, Integer programming, Heuristic, Networks
http://archive.org/details/gamsbasedmodelof00cain
Captain, United States Army
Hiremath, Chaitr. "New Heuristic And Metaheuristic Approaches Applied To The Multiple-choice Multidimensional Knapsack Problem". Wright State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=wright1203960454.
Pełny tekst źródłaKsiążki na temat "Heuristic research"
Moustakas, Clark E. Heuristic research: Design, methodology, and applications. Newbury Park: Sage Publications, 1990.
Znajdź pełny tekst źródłaAustin, Veronica. Learning from experience: Heuristic research study based on one music therapy session. [Guildford]: [University of Surrey], 1999.
Znajdź pełny tekst źródłaPietraś, Ziemowit Jacek. Sztuczna inteligencja w politologii: Heurystyczne modelowanie procesów adaptacji politycznej. Lublin: Wydawn. Uniwersytetu Marii Curie-Skłodowskiej, 1990.
Znajdź pełny tekst źródłaLinear A and Cypro-Minoan in the light of heuristics and cryptology: A research report. Szczecin: B.Z. Szałek, 2005.
Znajdź pełny tekst źródłaWoodruff, David L. Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search: Interfaces in Computer Science and Operations Research. Boston, MA: Springer US, 1998.
Znajdź pełny tekst źródłaFarahutdinov, Shamil'. Current trends and innovative methods in marketing research. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1016648.
Pełny tekst źródłaSimulating science: Heuristics, mental models, and technoscientific thinking. Bloomington: Indiana University Press, 1992.
Znajdź pełny tekst źródłaSzałek, Benon Zbigniew. The etruscan problem in the light of heuristics: A research report. Shczecin: B.Z. Szałek, 2003.
Znajdź pełny tekst źródłaSzałek, Benon Zbigniew. The mayan problem in the light of heuristics: (a research report). Szczecin [Poland]: PPH ZAPOL, 2004.
Znajdź pełny tekst źródłaVo€, Stefan. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston, MA: Springer US, 1999.
Znajdź pełny tekst źródłaCzęści książek na temat "Heuristic research"
Salhi, Saïd. "Applications, Conclusion and Research Challenges". W Heuristic Search, 189–209. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_7.
Pełny tekst źródłaJaiswal, N. K. "Heuristic Optimization". W Military Operations Research, 169–208. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6275-7_7.
Pełny tekst źródłaGass, Saul I., i Carl M. Harris. "heuristic". W Encyclopedia of Operations Research and Management Science, 731. New York, NY: Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_905.
Pełny tekst źródłaGass, Saul I., i Carl M. Harris. "heuristic". W Encyclopedia of Operations Research and Management Science, 731. New York, NY: Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_906.
Pełny tekst źródłaKlein, Robert. "Heuristic Procedures". W Operations Research/Computer Science Interfaces Series, 161–211. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4629-0_5.
Pełny tekst źródłaSalomon, Marc, Roelof Kuik i Luk N. Van Wassenhove. "A Lagrangian Heuristic for Multilevel Lotsizing". W Operations Research Proceedings, 433–39. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-77254-2_49.
Pełny tekst źródłaLang, Rainer, i Thomas Milius. "A Heuristic for the Nesting Problem". W Operations Research ’92, 130–31. Heidelberg: Physica-Verlag HD, 1993. http://dx.doi.org/10.1007/978-3-662-12629-5_36.
Pełny tekst źródłaHöhn, Sviatlana, i Kerstin Bongard-Blanchy. "Heuristic Evaluation of COVID-19 Chatbots". W Chatbot Research and Design, 131–44. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68288-0_9.
Pełny tekst źródłaDresbach, Stefan. "A New Heuristic Layout Algorithm for DAGs". W Operations Research Proceedings, 121–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-642-79459-9_23.
Pełny tekst źródłaBurke, Edmund, Moshe Dror, Sanja Petrovic i Rong Qu. "Hybrid Graph Heuristics within a Hyper-Heuristic Approach to Exam Timetabling Problems". W Operations Research/Computer Science Interfaces Series, 79–91. Boston, MA: Springer US, 2005. http://dx.doi.org/10.1007/0-387-23529-9_6.
Pełny tekst źródłaStreszczenia konferencji na temat "Heuristic research"
Downs, Simon T., i Claire A. Lerpiniere. "The Future of Heuristic Fossils". W Design Research Society Conference 2018. Design Research Society, 2018. http://dx.doi.org/10.21606/drs.2018.612.
Pełny tekst źródłaZhou, Qiang, Yanbin Fan i Changjiang Wei. "Heuristic Routing Protocol Research on Opportunistic Networks". W 2012 IEEE 14th Int'l Conf. on High Performance Computing and Communication (HPCC) & 2012 IEEE 9th Int'l Conf. on Embedded Software and Systems (ICESS). IEEE, 2012. http://dx.doi.org/10.1109/hpcc.2012.254.
Pełny tekst źródłaLi, Fa-chao, i Fei Guan. "Heuristic Model Research on Decision Tree Algorithm". W 2009 International Asia Symposium on Intelligent Interaction and Affective Computing (ASIA). IEEE, 2009. http://dx.doi.org/10.1109/asia.2009.34.
Pełny tekst źródłaLiu, Yang, i Miao Zhang. "Financial websites oriented heuristic anti-phishing research". W 2012 IEEE 2nd International Conference on Cloud Computing and Intelligence Systems (CCIS). IEEE, 2012. http://dx.doi.org/10.1109/ccis.2012.6664247.
Pełny tekst źródłaDou, Jihua, Xingbao Yang i Chuanwei Zhu. "Heuristic Teaching Method Research for Complex Systems". W Proceedings of the 5th International Conference on Arts, Design and Contemporary Education (ICADCE 2019). Paris, France: Atlantis Press, 2019. http://dx.doi.org/10.2991/icadce-19.2019.162.
Pełny tekst źródłaPiyadasun, Thilina, Buwaneka Kalansuriya, Malaka Gangananda, Minudika Malshan, H. M. N. Dilum Bandara i Suresh Marru. "Rationalizing police patrol beats using heuristic-based clustering". W 2017 Moratuwa Engineering Research Conference (MERCon). IEEE, 2017. http://dx.doi.org/10.1109/mercon.2017.7980523.
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łaLiu-bin, SHANG, Wang Wei i Liu Zhi-hua. "Research on Heuristic Mutated Particle Swarm Optimization Algorithm". W 2019 IEEE International Conference on Unmanned Systems (ICUS). IEEE, 2019. http://dx.doi.org/10.1109/icus48101.2019.8996019.
Pełny tekst źródłaLi, Yang, Yan Sun, Chengshan Han, Xiaodong Wang i Shuyan Xu. "Algorithm Research of Flexible Graphplan based on Heuristic". W 2008 9th International Conference for Young Computer Scientists (ICYCS). IEEE, 2008. http://dx.doi.org/10.1109/icycs.2008.473.
Pełny tekst źródłaBianchini, Carlo, Alessandro Viscogliosi i Alessandro Aglietti. "Innovative Digital Heuristic Approaches in Architectural Historical Research". W 2017 21st International Conference on Information Visualisation (IV). IEEE, 2017. http://dx.doi.org/10.1109/iv.2017.47.
Pełny tekst źródła