Artículos de revistas sobre el tema "Greedy heuristic algorithms"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Greedy heuristic algorithms".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Wilt, Christopher y Wheeler Ruml. "Building a Heuristic for Greedy Search". Proceedings of the International Symposium on Combinatorial Search 6, n.º 1 (1 de septiembre de 2021): 131–40. http://dx.doi.org/10.1609/socs.v6i1.18352.
Texto completoWilt, Christopher y Wheeler Ruml. "Effective Heuristics for Suboptimal Best-First Search". Journal of Artificial Intelligence Research 57 (31 de octubre de 2016): 273–306. http://dx.doi.org/10.1613/jair.5036.
Texto completoHignasari, L. Virginayoga. "Komparasi Algoritma Cheapest Insertion Heuristic (CIH) Dan Greedy Dalam Optimasi Rute Pendistribusian Barang". Jurnal Ilmiah Vastuwidya 2, n.º 2 (16 de junio de 2020): 31–39. http://dx.doi.org/10.47532/jiv.v2i2.87.
Texto completoTian, Heng, Fuhai Duan, Yong Sang y 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, n.º 6 (2 de mayo de 2020): 779–92. http://dx.doi.org/10.1177/1748006x20914498.
Texto completoPanggabean, Jonas Franky R. "Hybrid Ant Colony Optimization-Genetics Algorithm to Minimize Makespan Flow Shop Scheduling". International Journal of Engineering & Technology 7, n.º 2.2 (5 de marzo de 2018): 40. http://dx.doi.org/10.14419/ijet.v7i2.2.11868.
Texto completoSeeja, K. R. "HybridHAM: A Novel Hybrid Heuristic for Finding Hamiltonian Cycle". Journal of Optimization 2018 (16 de octubre de 2018): 1–10. http://dx.doi.org/10.1155/2018/9328103.
Texto completoSelvi, V. "Clustering Analysis of Greedy Heuristic Method in Zero_One Knapsack Problem". International Journal of Emerging Research in Management and Technology 6, n.º 7 (29 de junio de 2018): 39. http://dx.doi.org/10.23956/ijermt.v6i7.181.
Texto completoSilva Arantes, Jesimar da, Márcio da Silva Arantes, Claudio Fabiano Motta Toledo, Onofre Trindade Júnior y Brian Charles Williams. "Heuristic and Genetic Algorithm Approaches for UAV Path Planning under Critical Situation". International Journal on Artificial Intelligence Tools 26, n.º 01 (febrero de 2017): 1760008. http://dx.doi.org/10.1142/s0218213017600089.
Texto completoK, Gayathri Devi. "A Hybrid Firefly Algorithm Approach for Job Shop Scheduling Problem". International Journal for Research in Applied Science and Engineering Technology 9, n.º 12 (31 de diciembre de 2021): 1436–44. http://dx.doi.org/10.22214/ijraset.2021.39536.
Texto completoKazakovtsev, Lev, Dmitry Stashkov, Mikhail Gudyma y Vladimir Kazakovtsev. "Algorithms with greedy heuristic procedures for mixture probability distribution separation". Yugoslav Journal of Operations Research 29, n.º 1 (2019): 51–67. http://dx.doi.org/10.2298/yjor171107030k.
Texto completoShkaberina, Guzel, Leonid Verenev, Elena Tovbis, Natalia Rezova y Lev Kazakovtsev. "Clustering Algorithm with a Greedy Agglomerative Heuristic and Special Distance Measures". Algorithms 15, n.º 6 (1 de junio de 2022): 191. http://dx.doi.org/10.3390/a15060191.
Texto completoLagodimos, A. G. y V. Leopoulos. "Greedy heuristic algorithms for manpower shift planning". International Journal of Production Economics 68, n.º 1 (octubre de 2000): 95–106. http://dx.doi.org/10.1016/s0925-5273(99)00099-7.
Texto completoLaube, Uli y Maik Weinard. "CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM". International Journal of Foundations of Computer Science 16, n.º 06 (diciembre de 2005): 1219–30. http://dx.doi.org/10.1142/s0129054105003777.
Texto completoStern, Roni, Rami Puzis y Ariel Felner. "Potential Search: A New Greedy Anytime Heuristic Search". Proceedings of the International Symposium on Combinatorial Search 1, n.º 1 (25 de agosto de 2010): 119–20. http://dx.doi.org/10.1609/socs.v1i1.18177.
Texto completoAzriati Mat, Nur, Aida Mauziah Benjamin y Syariza Abdul-Rahman. "Efficiency of Heuristic Algorithms in Solving Waste Collection Vehicle Routing Problem: A Case Study". Journal of Social Sciences Research, SPI6 (25 de diciembre de 2018): 695–700. http://dx.doi.org/10.32861/jssr.spi6.695.700.
Texto completoSeipp, Jendrik, Thomas Keller y Malte Helmert. "A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning". Proceedings of the International Conference on Automated Planning and Scheduling 27 (5 de junio de 2017): 259–68. http://dx.doi.org/10.1609/icaps.v27i1.13823.
Texto completoKazakovtsev, Lev, Ivan Rozhnov, Guzel Shkaberina y Viktor Orlov. "K-Means Genetic Algorithms with Greedy Genetic Operators". Mathematical Problems in Engineering 2020 (27 de noviembre de 2020): 1–16. http://dx.doi.org/10.1155/2020/8839763.
Texto completoMontlevich, V. M. y 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, n.º 3 (31 de mayo de 2017): 115–20. http://dx.doi.org/10.18287/2541-7525-2014-20-3-115-120.
Texto completoEtzion, T. y P. R. J. Ostergard. "Greedy and heuristic algorithms for codes and colorings". IEEE Transactions on Information Theory 44, n.º 1 (1998): 382–88. http://dx.doi.org/10.1109/18.651069.
Texto completoKazakovtsev, L. A., I. P. Rozhnov, E. A. Popov, M. V. Karaseva y A. A. Stupina. "Parallel implementation of the greedy heuristic clustering algorithms". IOP Conference Series: Materials Science and Engineering 537 (17 de junio de 2019): 022052. http://dx.doi.org/10.1088/1757-899x/537/2/022052.
Texto completoJiang, Qingye, Guojie Song, Cong Gao, Yu Wang, Wenjun Si y Kunqing Xie. "Simulated Annealing Based Influence Maximization in Social Networks". Proceedings of the AAAI Conference on Artificial Intelligence 25, n.º 1 (4 de agosto de 2011): 127–32. http://dx.doi.org/10.1609/aaai.v25i1.7838.
Texto completoWu, Lin, Cai Li Fang y Cao Kun Yan. "A Novel Reliability-Driven Heuristic for Grid Task Scheduling". Applied Mechanics and Materials 291-294 (febrero de 2013): 2895–98. http://dx.doi.org/10.4028/www.scientific.net/amm.291-294.2895.
Texto completoChen, Wei, Wei Lu y Ning Zhang. "Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process". Proceedings of the AAAI Conference on Artificial Intelligence 26, n.º 1 (20 de septiembre de 2021): 591–98. http://dx.doi.org/10.1609/aaai.v26i1.8204.
Texto completoZhang, Yongfei, Jun Wu, Liming Zhang, Peng Zhao, Junping Zhou y Minghao Yin. "An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem". Mathematical Problems in Engineering 2018 (6 de septiembre de 2018): 1–10. http://dx.doi.org/10.1155/2018/3935804.
Texto completoPazis, Jason y Ronald Parr. "PAC Optimal Exploration in Continuous Space Markov Decision Processes". Proceedings of the AAAI Conference on Artificial Intelligence 27, n.º 1 (30 de junio de 2013): 774–81. http://dx.doi.org/10.1609/aaai.v27i1.8678.
Texto completoMandal, Ranjit Kr, Pinaki Mukherjee y Mousumi Maitra. "Solving Travelling Salesman Problem using Artificial Immune System Optimization (AISO)". Journal of Scientific Research 66, n.º 04 (2022): 114–20. http://dx.doi.org/10.37398/jsr.2022.660416.
Texto completoJi, Jie, Guohua Wu, Jinguo Shuai, Zhen Zhang, Zhen Wang y Yizhi Ren. "Heuristic Approaches for Enhancing the Privacy of the Leader in IoT Networks". Sensors 19, n.º 18 (9 de septiembre de 2019): 3886. http://dx.doi.org/10.3390/s19183886.
Texto completoAydın, Nevin. "Heuristic Clustering Algorithms in Ad hoc Networks". EMAJ: Emerging Markets Journal 3, n.º 3 (5 de marzo de 2014): 77–80. http://dx.doi.org/10.5195/emaj.2014.39.
Texto completoKhanna, Munish, Naresh Chauhan y Dilip Kumar Sharma. "Search for Prioritized Test Cases during Web Application Testing". International Journal of Applied Metaheuristic Computing 10, n.º 2 (abril de 2019): 1–26. http://dx.doi.org/10.4018/ijamc.2019040101.
Texto completoKask, Kalev, Andrew Gelfand, Lars Otten y Rina Dechter. "Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models". Proceedings of the AAAI Conference on Artificial Intelligence 25, n.º 1 (4 de agosto de 2011): 54–60. http://dx.doi.org/10.1609/aaai.v25i1.7828.
Texto completoBasmassi, M. A., L. Benameur y 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 (23 de noviembre de 2020): 117–20. http://dx.doi.org/10.5194/isprs-archives-xliv-4-w3-2020-117-2020.
Texto completoWilt, Christopher, Jordan Thayer y Wheeler Ruml. "A Comparison of Greedy Search Algorithms". Proceedings of the International Symposium on Combinatorial Search 1, n.º 1 (25 de agosto de 2010): 129–36. http://dx.doi.org/10.1609/socs.v1i1.18182.
Texto completoLesh, N. y M. Mitzenmacher. "BubbleSearch: A simple heuristic for improving priority-based greedy algorithms". Information Processing Letters 97, n.º 4 (febrero de 2006): 161–69. http://dx.doi.org/10.1016/j.ipl.2005.08.013.
Texto completoFadlallah, Ghassan, Djamal Rebaine y Hamid Mcheick. "A Greedy Scheduling Approach for Peripheral Mobile Intelligent Systems". IoT 2, n.º 2 (30 de abril de 2021): 249–74. http://dx.doi.org/10.3390/iot2020014.
Texto completoPrihozhy, A. A. "Exact and greedy algorithms of allocating experts to maximum set of programmer teams". «System analysis and applied information science», n.º 1 (8 de junio de 2022): 40–46. http://dx.doi.org/10.21122/2309-4923-2022-1-40-46.
Texto completoKralev, Velin y Radoslava Kraleva. "A comparative analysis between two heuristic algorithms for the graph vertex coloring problem". International Journal of Electrical and Computer Engineering (IJECE) 13, n.º 3 (1 de junio de 2023): 2981. http://dx.doi.org/10.11591/ijece.v13i3.pp2981-2989.
Texto completoSheibani, 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, n.º 2 (abril de 2017): 58–72. http://dx.doi.org/10.4018/ijaec.2017040104.
Texto completoQiu, Liqing, Shuang Zhang, Chunmei Gu y Xiangbo Tian. "Scalable Influence Maximization Meets Efficiency and Effectiveness in Large-Scale Social Networks". International Journal of Software Engineering and Knowledge Engineering 30, n.º 08 (agosto de 2020): 1079–96. http://dx.doi.org/10.1142/s0218194020400161.
Texto completoEt.al, C. Jayasri. "A Novel Swarm Intelligence Optimized Spectrum Sensing Approach For Cognitive Radio Network". Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, n.º 6 (10 de abril de 2021): 136–43. http://dx.doi.org/10.17762/turcomat.v12i6.1278.
Texto completoThayer, Jordan, Austin Dionne y Wheeler Ruml. "Learning Inadmissible Heuristics During Search". Proceedings of the International Conference on Automated Planning and Scheduling 21 (22 de marzo de 2011): 250–57. http://dx.doi.org/10.1609/icaps.v21i1.13474.
Texto completoNamatevs, Ivars y Ludmila Aleksejeva. "Decision Algorithm for Heuristic Donor-Recipient Matching". MENDEL 23, n.º 1 (1 de junio de 2017): 33–40. http://dx.doi.org/10.13164/mendel.2017.1.033.
Texto completoBonet, B. y H. Geffner. "mGPT: A Probabilistic Planner Based on Heuristic Search". Journal of Artificial Intelligence Research 24 (28 de diciembre de 2005): 933–44. http://dx.doi.org/10.1613/jair.1688.
Texto completoÁbrahám, Gyula, György Dósa, Tibor Dulai, Zsolt Tuza y Á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, n.º 13 (1 de julio de 2021): 1540. http://dx.doi.org/10.3390/math9131540.
Texto completoBereta, Michał. "Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem". Journal of Telecommunications and Information Technology 4 (20 de diciembre de 2017): 71–81. http://dx.doi.org/10.26636/jtit.2017.122017.
Texto completoImai, Tatsuya y 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, n.º 1 (19 de agosto de 2021): 197–98. http://dx.doi.org/10.1609/socs.v2i1.18208.
Texto completoSong, Heping y 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.
Texto completoRichter, Silvia, Jordan Thayer y Wheeler Ruml. "The Joy of Forgetting: Faster Anytime Search via Restarting". Proceedings of the International Conference on Automated Planning and Scheduling 20 (25 de mayo de 2021): 137–44. http://dx.doi.org/10.1609/icaps.v20i1.13412.
Texto completoŁapczyńska, Dagmara, Konrad Łapczyński, Anna Burduk y Jose Machado. "Solving the problem of scheduling the production process based on heuristic algorithms". JUCS - Journal of Universal Computer Science 28, n.º 3 (28 de marzo de 2022): 292–310. http://dx.doi.org/10.3897/jucs.80750.
Texto completoAkbari, Abbas, Ahmad Khonsari y Seyed Mohammad Ghoreyshi. "Thermal-Aware Virtual Machine Allocation for Heterogeneous Cloud Data Centers". Energies 13, n.º 11 (4 de junio de 2020): 2880. http://dx.doi.org/10.3390/en13112880.
Texto completoChug, Anuradha y Sandhya Tarwani. "Identifying the Optimal Refactoring Dependencies Using Heuristic Search Algorithms to Maximize Maintainability". International Journal of Software Engineering and Knowledge Engineering 31, n.º 06 (junio de 2021): 803–35. http://dx.doi.org/10.1142/s0218194021500248.
Texto completo