Статті в журналах з теми "Greedy heuristic algorithms"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Greedy heuristic algorithms".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Wilt, Christopher, and Wheeler Ruml. "Building a Heuristic for Greedy Search." Proceedings of the International Symposium on Combinatorial Search 6, no. 1 (September 1, 2021): 131–40. http://dx.doi.org/10.1609/socs.v6i1.18352.
Повний текст джерелаWilt, Christopher, and Wheeler Ruml. "Effective Heuristics for Suboptimal Best-First Search." Journal of Artificial Intelligence Research 57 (October 31, 2016): 273–306. http://dx.doi.org/10.1613/jair.5036.
Повний текст джерелаHignasari, L. Virginayoga. "Komparasi Algoritma Cheapest Insertion Heuristic (CIH) Dan Greedy Dalam Optimasi Rute Pendistribusian Barang." Jurnal Ilmiah Vastuwidya 2, no. 2 (June 16, 2020): 31–39. http://dx.doi.org/10.47532/jiv.v2i2.87.
Повний текст джерелаTian, Heng, Fuhai Duan, Yong Sang, and Liang Fan. "Novel algorithms for sequential fault diagnosis based on greedy method." Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability 234, no. 6 (May 2, 2020): 779–92. http://dx.doi.org/10.1177/1748006x20914498.
Повний текст джерелаPanggabean, Jonas Franky R. "Hybrid Ant Colony Optimization-Genetics Algorithm to Minimize Makespan Flow Shop Scheduling." International Journal of Engineering & Technology 7, no. 2.2 (March 5, 2018): 40. http://dx.doi.org/10.14419/ijet.v7i2.2.11868.
Повний текст джерелаSeeja, K. R. "HybridHAM: A Novel Hybrid Heuristic for Finding Hamiltonian Cycle." Journal of Optimization 2018 (October 16, 2018): 1–10. http://dx.doi.org/10.1155/2018/9328103.
Повний текст джерелаSelvi, V. "Clustering Analysis of Greedy Heuristic Method in Zero_One Knapsack Problem." International Journal of Emerging Research in Management and Technology 6, no. 7 (June 29, 2018): 39. http://dx.doi.org/10.23956/ijermt.v6i7.181.
Повний текст джерелаSilva Arantes, Jesimar da, Márcio da Silva Arantes, Claudio Fabiano Motta Toledo, Onofre Trindade Júnior, and Brian Charles Williams. "Heuristic and Genetic Algorithm Approaches for UAV Path Planning under Critical Situation." International Journal on Artificial Intelligence Tools 26, no. 01 (February 2017): 1760008. http://dx.doi.org/10.1142/s0218213017600089.
Повний текст джерелаK, Gayathri Devi. "A Hybrid Firefly Algorithm Approach for Job Shop Scheduling Problem." International Journal for Research in Applied Science and Engineering Technology 9, no. 12 (December 31, 2021): 1436–44. http://dx.doi.org/10.22214/ijraset.2021.39536.
Повний текст джерелаKazakovtsev, Lev, Dmitry Stashkov, Mikhail Gudyma, and Vladimir Kazakovtsev. "Algorithms with greedy heuristic procedures for mixture probability distribution separation." Yugoslav Journal of Operations Research 29, no. 1 (2019): 51–67. http://dx.doi.org/10.2298/yjor171107030k.
Повний текст джерелаShkaberina, Guzel, Leonid Verenev, Elena Tovbis, Natalia Rezova, and Lev Kazakovtsev. "Clustering Algorithm with a Greedy Agglomerative Heuristic and Special Distance Measures." Algorithms 15, no. 6 (June 1, 2022): 191. http://dx.doi.org/10.3390/a15060191.
Повний текст джерелаLagodimos, A. G., and V. Leopoulos. "Greedy heuristic algorithms for manpower shift planning." International Journal of Production Economics 68, no. 1 (October 2000): 95–106. http://dx.doi.org/10.1016/s0925-5273(99)00099-7.
Повний текст джерелаLaube, Uli, and Maik Weinard. "CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM." International Journal of Foundations of Computer Science 16, no. 06 (December 2005): 1219–30. http://dx.doi.org/10.1142/s0129054105003777.
Повний текст джерелаStern, Roni, Rami Puzis, and Ariel Felner. "Potential Search: A New Greedy Anytime Heuristic Search." Proceedings of the International Symposium on Combinatorial Search 1, no. 1 (August 25, 2010): 119–20. http://dx.doi.org/10.1609/socs.v1i1.18177.
Повний текст джерелаAzriati Mat, Nur, Aida Mauziah Benjamin, and Syariza Abdul-Rahman. "Efficiency of Heuristic Algorithms in Solving Waste Collection Vehicle Routing Problem: A Case Study." Journal of Social Sciences Research, SPI6 (December 25, 2018): 695–700. http://dx.doi.org/10.32861/jssr.spi6.695.700.
Повний текст джерелаSeipp, Jendrik, Thomas Keller, and Malte Helmert. "A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning." Proceedings of the International Conference on Automated Planning and Scheduling 27 (June 5, 2017): 259–68. http://dx.doi.org/10.1609/icaps.v27i1.13823.
Повний текст джерелаKazakovtsev, Lev, Ivan Rozhnov, Guzel Shkaberina, and Viktor Orlov. "K-Means Genetic Algorithms with Greedy Genetic Operators." Mathematical Problems in Engineering 2020 (November 27, 2020): 1–16. http://dx.doi.org/10.1155/2020/8839763.
Повний текст джерелаMontlevich, V. M., and A. N. Ismailova. "EMPIRICAL ANALYSIS OF APPROXIMATE ALGORITHMS FOR INTEGER PROGRAMMING, BASED UPON THE IDEA OF GREEDY CHOICE." Vestnik of Samara University. Natural Science Series 20, no. 3 (May 31, 2017): 115–20. http://dx.doi.org/10.18287/2541-7525-2014-20-3-115-120.
Повний текст джерелаEtzion, T., and P. R. J. Ostergard. "Greedy and heuristic algorithms for codes and colorings." IEEE Transactions on Information Theory 44, no. 1 (1998): 382–88. http://dx.doi.org/10.1109/18.651069.
Повний текст джерелаKazakovtsev, L. A., I. P. Rozhnov, E. A. Popov, M. V. Karaseva, and A. A. Stupina. "Parallel implementation of the greedy heuristic clustering algorithms." IOP Conference Series: Materials Science and Engineering 537 (June 17, 2019): 022052. http://dx.doi.org/10.1088/1757-899x/537/2/022052.
Повний текст джерелаJiang, Qingye, Guojie Song, Cong Gao, Yu Wang, Wenjun Si, and Kunqing Xie. "Simulated Annealing Based Influence Maximization in Social Networks." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (August 4, 2011): 127–32. http://dx.doi.org/10.1609/aaai.v25i1.7838.
Повний текст джерелаWu, Lin, Cai Li Fang, and Cao Kun Yan. "A Novel Reliability-Driven Heuristic for Grid Task Scheduling." Applied Mechanics and Materials 291-294 (February 2013): 2895–98. http://dx.doi.org/10.4028/www.scientific.net/amm.291-294.2895.
Повний текст джерелаChen, Wei, Wei Lu, and Ning Zhang. "Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process." Proceedings of the AAAI Conference on Artificial Intelligence 26, no. 1 (September 20, 2021): 591–98. http://dx.doi.org/10.1609/aaai.v26i1.8204.
Повний текст джерелаZhang, Yongfei, Jun Wu, Liming Zhang, Peng Zhao, Junping Zhou, and Minghao Yin. "An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem." Mathematical Problems in Engineering 2018 (September 6, 2018): 1–10. http://dx.doi.org/10.1155/2018/3935804.
Повний текст джерелаPazis, Jason, and Ronald Parr. "PAC Optimal Exploration in Continuous Space Markov Decision Processes." Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 30, 2013): 774–81. http://dx.doi.org/10.1609/aaai.v27i1.8678.
Повний текст джерелаMandal, Ranjit Kr, Pinaki Mukherjee, and Mousumi Maitra. "Solving Travelling Salesman Problem using Artificial Immune System Optimization (AISO)." Journal of Scientific Research 66, no. 04 (2022): 114–20. http://dx.doi.org/10.37398/jsr.2022.660416.
Повний текст джерелаJi, Jie, Guohua Wu, Jinguo Shuai, Zhen Zhang, Zhen Wang, and Yizhi Ren. "Heuristic Approaches for Enhancing the Privacy of the Leader in IoT Networks." Sensors 19, no. 18 (September 9, 2019): 3886. http://dx.doi.org/10.3390/s19183886.
Повний текст джерелаAydın, Nevin. "Heuristic Clustering Algorithms in Ad hoc Networks." EMAJ: Emerging Markets Journal 3, no. 3 (March 5, 2014): 77–80. http://dx.doi.org/10.5195/emaj.2014.39.
Повний текст джерелаKhanna, Munish, Naresh Chauhan, and Dilip Kumar Sharma. "Search for Prioritized Test Cases during Web Application Testing." International Journal of Applied Metaheuristic Computing 10, no. 2 (April 2019): 1–26. http://dx.doi.org/10.4018/ijamc.2019040101.
Повний текст джерелаKask, Kalev, Andrew Gelfand, Lars Otten, and Rina Dechter. "Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (August 4, 2011): 54–60. http://dx.doi.org/10.1609/aaai.v25i1.7828.
Повний текст джерелаBasmassi, M. A., L. Benameur, and J. A. Chentoufi. "A NOVEL GREEDY GENETIC ALGORITHM TO SOLVE COMBINATORIAL OPTIMIZATION PROBLEM." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLIV-4/W3-2020 (November 23, 2020): 117–20. http://dx.doi.org/10.5194/isprs-archives-xliv-4-w3-2020-117-2020.
Повний текст джерелаWilt, Christopher, Jordan Thayer, and Wheeler Ruml. "A Comparison of Greedy Search Algorithms." Proceedings of the International Symposium on Combinatorial Search 1, no. 1 (August 25, 2010): 129–36. http://dx.doi.org/10.1609/socs.v1i1.18182.
Повний текст джерелаLesh, N., and M. Mitzenmacher. "BubbleSearch: A simple heuristic for improving priority-based greedy algorithms." Information Processing Letters 97, no. 4 (February 2006): 161–69. http://dx.doi.org/10.1016/j.ipl.2005.08.013.
Повний текст джерелаFadlallah, Ghassan, Djamal Rebaine, and Hamid Mcheick. "A Greedy Scheduling Approach for Peripheral Mobile Intelligent Systems." IoT 2, no. 2 (April 30, 2021): 249–74. http://dx.doi.org/10.3390/iot2020014.
Повний текст джерелаPrihozhy, A. A. "Exact and greedy algorithms of allocating experts to maximum set of programmer teams." «System analysis and applied information science», no. 1 (June 8, 2022): 40–46. http://dx.doi.org/10.21122/2309-4923-2022-1-40-46.
Повний текст джерелаKralev, Velin, and Radoslava Kraleva. "A comparative analysis between two heuristic algorithms for the graph vertex coloring problem." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 3 (June 1, 2023): 2981. http://dx.doi.org/10.11591/ijece.v13i3.pp2981-2989.
Повний текст джерелаSheibani, Kaveh. "An Incorporation of the Fuzzy Greedy Search Heuristic With Evolutionary Approaches for Combinatorial Optimization in Operations Management." International Journal of Applied Evolutionary Computation 8, no. 2 (April 2017): 58–72. http://dx.doi.org/10.4018/ijaec.2017040104.
Повний текст джерелаQiu, Liqing, Shuang Zhang, Chunmei Gu, and Xiangbo Tian. "Scalable Influence Maximization Meets Efficiency and Effectiveness in Large-Scale Social Networks." International Journal of Software Engineering and Knowledge Engineering 30, no. 08 (August 2020): 1079–96. http://dx.doi.org/10.1142/s0218194020400161.
Повний текст джерелаEt.al, C. Jayasri. "A Novel Swarm Intelligence Optimized Spectrum Sensing Approach For Cognitive Radio Network." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 6 (April 10, 2021): 136–43. http://dx.doi.org/10.17762/turcomat.v12i6.1278.
Повний текст джерелаThayer, Jordan, Austin Dionne, and Wheeler Ruml. "Learning Inadmissible Heuristics During Search." Proceedings of the International Conference on Automated Planning and Scheduling 21 (March 22, 2011): 250–57. http://dx.doi.org/10.1609/icaps.v21i1.13474.
Повний текст джерелаNamatevs, Ivars, and Ludmila Aleksejeva. "Decision Algorithm for Heuristic Donor-Recipient Matching." MENDEL 23, no. 1 (June 1, 2017): 33–40. http://dx.doi.org/10.13164/mendel.2017.1.033.
Повний текст джерелаBonet, B., and H. Geffner. "mGPT: A Probabilistic Planner Based on Heuristic Search." Journal of Artificial Intelligence Research 24 (December 28, 2005): 933–44. http://dx.doi.org/10.1613/jair.1688.
Повний текст джерелаÁbrahám, Gyula, György Dósa, Tibor Dulai, Zsolt Tuza, and Ágnes Werner-Stark. "Efficient Pre-Solve Algorithms for the Schwerin and Falkenauer_U Bin Packing Benchmark Problems for Getting Optimal Solutions with High Probability." Mathematics 9, no. 13 (July 1, 2021): 1540. http://dx.doi.org/10.3390/math9131540.
Повний текст джерелаBereta, Michał. "Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem." Journal of Telecommunications and Information Technology 4 (December 20, 2017): 71–81. http://dx.doi.org/10.26636/jtit.2017.122017.
Повний текст джерелаImai, Tatsuya, and Akihiro Kishimoto. "A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning." Proceedings of the International Symposium on Combinatorial Search 2, no. 1 (August 19, 2021): 197–98. http://dx.doi.org/10.1609/socs.v2i1.18208.
Повний текст джерелаSong, Heping, and Guoli Wang. "Sparse Signal Recovery via ECME Thresholding Pursuits." Mathematical Problems in Engineering 2012 (2012): 1–22. http://dx.doi.org/10.1155/2012/478931.
Повний текст джерелаRichter, Silvia, Jordan Thayer, and Wheeler Ruml. "The Joy of Forgetting: Faster Anytime Search via Restarting." Proceedings of the International Conference on Automated Planning and Scheduling 20 (May 25, 2021): 137–44. http://dx.doi.org/10.1609/icaps.v20i1.13412.
Повний текст джерелаŁapczyńska, Dagmara, Konrad Łapczyński, Anna Burduk, and Jose Machado. "Solving the problem of scheduling the production process based on heuristic algorithms." JUCS - Journal of Universal Computer Science 28, no. 3 (March 28, 2022): 292–310. http://dx.doi.org/10.3897/jucs.80750.
Повний текст джерелаAkbari, Abbas, Ahmad Khonsari, and Seyed Mohammad Ghoreyshi. "Thermal-Aware Virtual Machine Allocation for Heterogeneous Cloud Data Centers." Energies 13, no. 11 (June 4, 2020): 2880. http://dx.doi.org/10.3390/en13112880.
Повний текст джерелаChug, Anuradha, and Sandhya Tarwani. "Identifying the Optimal Refactoring Dependencies Using Heuristic Search Algorithms to Maximize Maintainability." International Journal of Software Engineering and Knowledge Engineering 31, no. 06 (June 2021): 803–35. http://dx.doi.org/10.1142/s0218194021500248.
Повний текст джерела