Zeitschriftenartikel zum Thema „Heuristic“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Heuristic" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
Sanggala, Ekra, und 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.
Seipp, Jendrik. „Better Orders for Saturated Cost Partitioning in Optimal Classical Planning“. Proceedings of the International Symposium on Combinatorial Search 8, Nr. 1 (01.09.2021): 149–53. http://dx.doi.org/10.1609/socs.v8i1.18438.
Wilt, Christopher, und 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.
Ursani, Ziauddin, und 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.
Özcan, Ender, Mustafa Misir, Gabriela Ochoa und Edmund K. Burke. „A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling“. International Journal of Applied Metaheuristic Computing 1, Nr. 1 (Januar 2010): 39–59. http://dx.doi.org/10.4018/jamc.2010102603.
Kuroiwa, Ryo, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro und J. Christopher Beck. „LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions“. Proceedings of the International Conference on Automated Planning and Scheduling 31 (17.05.2021): 210–18. http://dx.doi.org/10.1609/icaps.v31i1.15964.
BOUZY, BRUNO. „HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO“. New Mathematics and Natural Computation 02, Nr. 02 (Juli 2006): 139–46. http://dx.doi.org/10.1142/s1793005706000427.
Wilt, Christopher, und Wheeler Ruml. „Speedy Versus Greedy Search“. Proceedings of the International Symposium on Combinatorial Search 5, Nr. 1 (01.09.2021): 184–92. http://dx.doi.org/10.1609/socs.v5i1.18320.
Speck, David, André Biedenkapp, Frank Hutter, Robert Mattmüller und Marius Lindauer. „Learning Heuristic Selection with Dynamic Algorithm Configuration“. Proceedings of the International Conference on Automated Planning and Scheduling 31 (17.05.2021): 597–605. http://dx.doi.org/10.1609/icaps.v31i1.16008.
Seipp, Jendrik, Florian Pommerening und Malte Helmert. „New Optimization Functions for Potential Heuristics“. Proceedings of the International Conference on Automated Planning and Scheduling 25 (08.04.2015): 193–201. http://dx.doi.org/10.1609/icaps.v25i1.13714.
Drake, John H., Matthew Hyde, Khaled Ibrahim und Ender Ozcan. „A genetic programming hyper-heuristic for the multidimensional knapsack problem“. Kybernetes 43, Nr. 9/10 (03.11.2014): 1500–1511. http://dx.doi.org/10.1108/k-09-2013-0201.
Wallace, Steve, Adrian Reid, Jin-Su Kang und Daniel Clinciu. „A Comparison of the Usability of Heuristic Evaluations for Online Help“. Information Design Journal 20, Nr. 1 (23.09.2013): 58–68. http://dx.doi.org/10.1075/idj.20.1.05wal.
Poo Hernandez, Sergio, und Vadim Bulitko. „Speeding Up Heuristic Function Synthesis via Extending the Formula Grammar“. Proceedings of the International Symposium on Combinatorial Search 12, Nr. 1 (21.07.2021): 233–35. http://dx.doi.org/10.1609/socs.v12i1.18594.
Pommerening, Florian, Gabriele Röger, Malte Helmert und 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.
Narayanan, Venkatraman, Sandip Aine und Maxim Likhachev. „Improved Multi-Heuristic A* for Searching with Uncalibrated Heuristics“. Proceedings of the International Symposium on Combinatorial Search 6, Nr. 1 (01.09.2021): 78–86. http://dx.doi.org/10.1609/socs.v6i1.18350.
Savolainen, Reijo. „Heuristics elements of information-seeking strategies and tactics: a conceptual analysis“. Journal of Documentation 73, Nr. 6 (09.10.2017): 1322–42. http://dx.doi.org/10.1108/jd-11-2016-0144.
Luna Gutierrez, Ricardo, und Matteo Leonetti. „Meta Reinforcement Learning for Heuristic Planing“. Proceedings of the International Conference on Automated Planning and Scheduling 31 (17.05.2021): 551–59. http://dx.doi.org/10.1609/icaps.v31i1.16003.
Aine, Sandip, Siddharth Swaminathan, Venkatraman Narayanan, Victor Hwang und Maxim Likhachev. „Multi-Heuristic A*“. Proceedings of the International Symposium on Combinatorial Search 5, Nr. 1 (01.09.2021): 207–8. http://dx.doi.org/10.1609/socs.v5i1.18306.
Moon, Seongsoo, und Mary Inaba. „Boost SAT Solver with Hybrid Branching Heuristic“. Proceedings of the International Symposium on Combinatorial Search 8, Nr. 1 (01.09.2021): 56–63. http://dx.doi.org/10.1609/socs.v8i1.18422.
Shanklin, Roslyn, Philip Kortum und Claudia Ziegler Acemyan. „Adaptation of Heuristic Evaluations for the Physical Environment“. Proceedings of the Human Factors and Ergonomics Society Annual Meeting 64, Nr. 1 (Dezember 2020): 1135–39. http://dx.doi.org/10.1177/1071181320641272.
Dienes, Zoltan. „How Do I Know What My Theory Predicts?“ Advances in Methods and Practices in Psychological Science 2, Nr. 4 (14.11.2019): 364–77. http://dx.doi.org/10.1177/2515245919876960.
Soria-Alcaraz, Jorge A., Gabriela Ochoa, Andres Espinal, Marco A. Sotelo-Figueroa, Manuel Ornelas-Rodriguez und Horacio Rostro-Gonzalez. „A Methodology for Classifying Search Operators as Intensification or Diversification Heuristics“. Complexity 2020 (13.02.2020): 1–10. http://dx.doi.org/10.1155/2020/2871835.
tetlock, philip e. „gauging the heuristic value of heuristics“. Behavioral and Brain Sciences 28, Nr. 4 (August 2005): 562–63. http://dx.doi.org/10.1017/s0140525x05430095.
Helmert, Malte. „Landmark Heuristics for the Pancake Problem“. Proceedings of the International Symposium on Combinatorial Search 1, Nr. 1 (25.08.2010): 109–10. http://dx.doi.org/10.1609/socs.v1i1.18176.
Domshlak, Carmel, Erez Karpas und Shaul Markovitch. „To Max or Not to Max: Online Learning for Speeding Up Optimal Planning“. Proceedings of the AAAI Conference on Artificial Intelligence 24, Nr. 1 (04.07.2010): 1071–76. http://dx.doi.org/10.1609/aaai.v24i1.7741.
Sievers, Silvan, Martin Wehrle, Malte Helmert und Michael Katz. „Strengthening Canonical Pattern Databases with Structural Symmetries“. Proceedings of the International Symposium on Combinatorial Search 8, Nr. 1 (01.09.2021): 91–99. http://dx.doi.org/10.1609/socs.v8i1.18429.
Uzoma, Ihediohamma Raphael, Shelena Soosay Nathan, Nor Laily Hashim und Hanif. „INCLUSIVITY IN MOBILE SHOPPING APPS: AN EMPHASIS ON LEARNABILITY CHECKLISTS IN CONDUCTING A HEURISTIC EVALUATION“. Journal of Digital System Development 1 (31.10.2023): 46–58. http://dx.doi.org/10.32890/jdsd2023.1.5.
Drake, John H., Ender Özcan und Edmund K. Burke. „A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem“. Evolutionary Computation 24, Nr. 1 (März 2016): 113–41. http://dx.doi.org/10.1162/evco_a_00145.
Fišer, Daniel, Álvaro Torralba und Jörg Hoffmann. „Operator-Potential Heuristics for Symbolic Search“. Proceedings of the AAAI Conference on Artificial Intelligence 36, Nr. 9 (28.06.2022): 9750–57. http://dx.doi.org/10.1609/aaai.v36i9.21210.
Clausecker, Robert K. P., und Florian Schintke. „A Measure of Quality for IDA* Heuristics“. Proceedings of the International Symposium on Combinatorial Search 12, Nr. 1 (21.07.2021): 55–63. http://dx.doi.org/10.1609/socs.v12i1.18551.
Fortunato, David, und Randolph T. Stevenson. „Heuristics in Context“. Political Science Research and Methods 7, Nr. 2 (17.10.2016): 311–30. http://dx.doi.org/10.1017/psrm.2016.37.
Veerapaneni, Rishi, Muhammad Suhail Saleem und Maxim Likhachev. „Learning Local Heuristics for Search-Based Navigation Planning“. Proceedings of the International Conference on Automated Planning and Scheduling 33, Nr. 1 (01.07.2023): 634–38. http://dx.doi.org/10.1609/icaps.v33i1.27245.
Ursani, Ziauddin, und 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.
Yiu, Ying Fung, Jing Du und Rabi Mahapatra. „Evolutionary Heuristic A* Search: Pathfinding Algorithm with Self-Designed and Optimized Heuristic Function“. International Journal of Semantic Computing 13, Nr. 01 (März 2019): 5–23. http://dx.doi.org/10.1142/s1793351x19400014.
Cox, James L., Stephen Lucci und Tayfun Pay. „Effects of Dynamic Variable - Value Ordering Heuristics on the Search Space of Sudoku Modeled as a Constraint Satisfaction Problem“. Inteligencia Artificial 22, Nr. 63 (10.01.2019): 1–15. http://dx.doi.org/10.4114/intartif.vol22iss63pp1-15.
Domshlak, C., E. Karpas und S. Markovitch. „Online Speedup Learning for Optimal Planning“. Journal of Artificial Intelligence Research 44 (21.08.2012): 709–55. http://dx.doi.org/10.1613/jair.3676.
Chen, Wenlin, Yixin Chen, Kilian Weinberger, Qiang Lu und Xiaoping Chen. „Goal-Oriented Euclidean Heuristics with Manifold Learning“. Proceedings of the AAAI Conference on Artificial Intelligence 27, Nr. 1 (30.06.2013): 173–79. http://dx.doi.org/10.1609/aaai.v27i1.8615.
Trevizan, Felipe, Sylvie Thiébaux und Patrik Haslum. „Occupation Measure Heuristics for Probabilistic Planning“. Proceedings of the International Conference on Automated Planning and Scheduling 27 (05.06.2017): 306–15. http://dx.doi.org/10.1609/icaps.v27i1.13840.
Helmert, Malte, und Carmel Domshlak. „Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?“ Proceedings of the International Conference on Automated Planning and Scheduling 19 (16.10.2009): 162–69. http://dx.doi.org/10.1609/icaps.v19i1.13370.
Speck, David, Florian Geißer und Robert Mattmüller. „When Perfect Is Not Good Enough: On the Search Behaviour of Symbolic Heuristic Search“. Proceedings of the International Conference on Automated Planning and Scheduling 30 (01.06.2020): 263–71. http://dx.doi.org/10.1609/icaps.v30i1.6670.
Goldenberg, Meir, Ariel Felner, Nathan Sturtevant und Jonathan Schaeffer. „Portal-Based True-Distance Heuristics for Path Finding“. Proceedings of the International Symposium on Combinatorial Search 1, Nr. 1 (25.08.2010): 39–45. http://dx.doi.org/10.1609/socs.v1i1.18169.
Mellouli, O., I. Hafidi und A. Metrane. „A modified choice function hyper-heuristic with Boltzmann function“. Mathematical Modeling and Computing 8, Nr. 4 (2021): 736–46. http://dx.doi.org/10.23939/mmc2021.04.736.
Lissovoi, Andrei, Pietro S. Oliveto und John Alasdair Warwicker. „On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation“. Proceedings of the AAAI Conference on Artificial Intelligence 33 (17.07.2019): 2322–29. http://dx.doi.org/10.1609/aaai.v33i01.33012322.
Haslum, Patrik. „hm(P) = h1(Pm): Alternative Characterisations of the Generalisation From hmax To hm“. Proceedings of the International Conference on Automated Planning and Scheduling 19 (16.10.2009): 354–57. http://dx.doi.org/10.1609/icaps.v19i1.13384.
Štolba, Michal, Daniel Fišer und Antonín Komenda. „Potential Heuristics for Multi-Agent Planning“. Proceedings of the International Conference on Automated Planning and Scheduling 26 (30.03.2016): 308–16. http://dx.doi.org/10.1609/icaps.v26i1.13757.
Liang, Rui Shi, und Min Huang. „Heuristics for Domain-Independent Planning: A Survey“. Applied Mechanics and Materials 135-136 (Oktober 2011): 573–77. http://dx.doi.org/10.4028/www.scientific.net/amm.135-136.573.
Zahavi, U., A. Felner, N. Burch und R. C. Holte. „Predicting the Performance of IDA* using Conditional Distributions“. Journal of Artificial Intelligence Research 37 (18.02.2010): 41–83. http://dx.doi.org/10.1613/jair.2890.
Kirilenko, Daniil, Anton Andreychuk, Aleksandr Panov und Konstantin Yakovlev. „TransPath: Learning Heuristics for Grid-Based Pathfinding via Transformers“. Proceedings of the AAAI Conference on Artificial Intelligence 37, Nr. 10 (26.06.2023): 12436–43. http://dx.doi.org/10.1609/aaai.v37i10.26465.
Greco, Matias, Pablo Araneda und Jorge A. Baier. „Focal Discrepancy Search for Learned Heuristics (Extended Abstract)“. Proceedings of the International Symposium on Combinatorial Search 15, Nr. 1 (17.07.2022): 282–84. http://dx.doi.org/10.1609/socs.v15i1.21786.
Rintanen, Jussi. „Heuristics for Planning with SAT and Expressive Action Definitions“. Proceedings of the International Conference on Automated Planning and Scheduling 21 (22.03.2011): 210–17. http://dx.doi.org/10.1609/icaps.v21i1.13478.