Artículos de revistas sobre el tema "Batches of task graphs"
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 "Batches of task graphs".
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.
DIAKITÉ, SÉKOU, LORIS MARCHAL, JEAN-MARC NICOD y LAURENT PHILIPPE. "PRACTICAL STEADY-STATE SCHEDULING FOR TREE-SHAPED TASK GRAPHS". Parallel Processing Letters 21, n.º 04 (diciembre de 2011): 397–412. http://dx.doi.org/10.1142/s0129626411000291.
Texto completoWang, Xun, Chaogang Zhang, Ying Zhang, Xiangyu Meng, Zhiyuan Zhang, Xin Shi y Tao Song. "IMGG: Integrating Multiple Single-Cell Datasets through Connected Graphs and Generative Adversarial Networks". International Journal of Molecular Sciences 23, n.º 4 (14 de febrero de 2022): 2082. http://dx.doi.org/10.3390/ijms23042082.
Texto completoWang, Yue, Ruiqi Xu, Xun Jian, Alexander Zhou y Lei Chen. "Towards distributed bitruss decomposition on bipartite graphs". Proceedings of the VLDB Endowment 15, n.º 9 (mayo de 2022): 1889–901. http://dx.doi.org/10.14778/3538598.3538610.
Texto completoJia, Haozhang. "Graph sampling based deep metric learning for cross-view geo-localization". Journal of Physics: Conference Series 2711, n.º 1 (1 de febrero de 2024): 012004. http://dx.doi.org/10.1088/1742-6596/2711/1/012004.
Texto completoAngriman, Eugenio, Michał Boroń y Henning Meyerhenke. "A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching". ACM Journal of Experimental Algorithmics 27 (31 de diciembre de 2022): 1–41. http://dx.doi.org/10.1145/3529228.
Texto completoZhang, Xin, Yanyan Shen, Yingxia Shao y Lei Chen. "DUCATI: A Dual-Cache Training System for Graph Neural Networks on Giant Graphs with the GPU". Proceedings of the ACM on Management of Data 1, n.º 2 (13 de junio de 2023): 1–24. http://dx.doi.org/10.1145/3589311.
Texto completoVo, Tham y Phuc Do. "GOW-Stream: A novel approach of graph-of-words based mixture model for semantic-enhanced text stream clustering". Intelligent Data Analysis 25, n.º 5 (15 de septiembre de 2021): 1211–31. http://dx.doi.org/10.3233/ida-205443.
Texto completoDa San Martino, Giovanni, Alessandro Sperduti, Fabio Aiolli y Alessandro Moschitti. "Efficient Online Learning for Mapping Kernels on Linguistic Structures". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julio de 2019): 3421–28. http://dx.doi.org/10.1609/aaai.v33i01.33013421.
Texto completoLuo, Haoran, Haihong E, Yuhao Yang, Gengxian Zhou, Yikai Guo, Tianyu Yao, Zichen Tang, Xueyuan Lin y Kaiyang Wan. "NQE: N-ary Query Embedding for Complex Query Answering over Hyper-Relational Knowledge Graphs". Proceedings of the AAAI Conference on Artificial Intelligence 37, n.º 4 (26 de junio de 2023): 4543–51. http://dx.doi.org/10.1609/aaai.v37i4.25576.
Texto completoAuerbach, Joshua, David F. Bacon, Rachid Guerraoui, Jesper Honig Spring y Jan Vitek. "Flexible task graphs". ACM SIGPLAN Notices 43, n.º 7 (27 de junio de 2008): 1–11. http://dx.doi.org/10.1145/1379023.1375659.
Texto completoBENTEN, MUHAMMAD S. T. y SADIQ M. SAIT. "Genetic scheduling of task graphs". International Journal of Electronics 77, n.º 4 (octubre de 1994): 401–15. http://dx.doi.org/10.1080/00207219408926072.
Texto completoRanade, Abhiram G. "Scheduling loosely connected task graphs". Journal of Computer and System Sciences 67, n.º 1 (agosto de 2003): 198–208. http://dx.doi.org/10.1016/s0022-0000(03)00071-0.
Texto completoФомина, Мария, Mariya Fomina, Владимир Коновалов, Vladimir Konovalov, Вячеслав Терюшков, Vyacheslav Teryushkov, Алексей Чупшев y Aleksey Chupshev. "THE EFFECT OF MIXING DURATION AND THE PROPORTION OF SMALLER COMPONENT FOR THE PERFORMANCE OF THE PADDLE MIXER RUNNING WITH EXTRA BLADES". Bulletin Samara State Agricultural Academy 2, n.º 3 (27 de julio de 2017): 40–45. http://dx.doi.org/10.12737/17452.
Texto completoGanesan, Ghurumuruhan. "Weighted Eulerian extensions of random graphs". Gulf Journal of Mathematics 16, n.º 2 (12 de abril de 2024): 1–11. http://dx.doi.org/10.56947/gjom.v16i2.1866.
Texto completoGupta, Apurv, Gilles Parmentier y Denis Trystram. "Scheduling Precedence Task Graphs with Disturbances". RAIRO - Operations Research 37, n.º 3 (julio de 2003): 145–56. http://dx.doi.org/10.1051/ro:2003018.
Texto completoLee, J., L. F. Lai y W. T. Haung. "Task-based specifications through conceptual graphs". IEEE Expert 11, n.º 4 (agosto de 1996): 60–70. http://dx.doi.org/10.1109/64.511868.
Texto completoSemar Shahul, Ahmed Zaki y Oliver Sinnen. "Scheduling task graphs optimally with A*". Journal of Supercomputing 51, n.º 3 (marzo de 2010): 310–32. http://dx.doi.org/10.1007/s11227-010-0395-1.
Texto completoGalkin, Alexander, Vladimir Istomin y Vladimir Alekseev. "Automation of Assembly Batches Hot Rolled of Metallurgical Production". Mathematical Physics and Computer Simulation, n.º 4 (diciembre de 2022): 66–77. http://dx.doi.org/10.15688/mpcm.jvolsu.2022.4.6.
Texto completoJohnson, Heather Lynn, Evan D. McClintock y Amber Gardner. "Opportunities for Reasoning: Digital Task Design to Promote Students’ Conceptions of Graphs as Representing Relationships between Quantities". Digital Experiences in Mathematics Education 6, n.º 3 (28 de febrero de 2020): 340–66. http://dx.doi.org/10.1007/s40751-020-00061-9.
Texto completoFeidengol'd, V. B. "Factors determining of forming grain batches at procurement elevators and grain receiving enterprises". Khleboproducty 31, n.º 5 (2022): 26–33. http://dx.doi.org/10.32462/0235-2508-2022-31-5-26-33.
Texto completoKOTLERMAN, LILI, IDO DAGAN, BERNARDO MAGNINI y LUISA BENTIVOGLI. "Textual entailment graphs". Natural Language Engineering 21, n.º 5 (23 de junio de 2015): 699–724. http://dx.doi.org/10.1017/s1351324915000108.
Texto completoEkenna, Ifeoma Cynthia y Sunday Okorie Abali. "Comparison of the Use of Kinetic Model Plots and DD Solver Software to Evaluate the Drug Release from Griseofulvin Tablets". Journal of Drug Delivery and Therapeutics 12, n.º 2-S (15 de abril de 2022): 5–13. http://dx.doi.org/10.22270/jddt.v12i2-s.5402.
Texto completoEkenna, Ifeoma Cynthia y Sunday Okorie Abali. "Comparison of the Use of Kinetic Model Plots and DD Solver Software to Evaluate the Drug Release from Griseofulvin Tablets". Journal of Drug Delivery and Therapeutics 12, n.º 2-S (15 de abril de 2022): 5–13. http://dx.doi.org/10.22270/jddt.v12i2-s.5402.
Texto completoLai, Zeqiang, Kaixuan Wei, Ying Fu, Philipp Härtel y Felix Heide. "∇-Prox: Differentiable Proximal Algorithm Modeling for Large-Scale Optimization". ACM Transactions on Graphics 42, n.º 4 (26 de julio de 2023): 1–19. http://dx.doi.org/10.1145/3592144.
Texto completoPRADEEP, B. y C. SIVA RAM MURTHY. "A CONSTANT TIME ALGORITHM FOR REDUNDANCY ELIMINATION IN TASK GRAPHS ON PROCESSOR ARRAYS WITH RECONFIGURABLE BUS SYSTEMS". Parallel Processing Letters 03, n.º 02 (junio de 1993): 171–77. http://dx.doi.org/10.1142/s0129626493000216.
Texto completoSun, Jinghao, Tao Jin, Yekai Xue, Liwei Zhang, Jinrong Liu, Nan Guan y Quan Zhou. "ompTG: From OpenMP Programs to Task Graphs". Journal of Systems Architecture 126 (mayo de 2022): 102470. http://dx.doi.org/10.1016/j.sysarc.2022.102470.
Texto completoKari, Chadi, Alexander Russell y Narasimha Shashidhar. "Work-Competitive Scheduling on Task Dependency Graphs". Parallel Processing Letters 25, n.º 02 (junio de 2015): 1550001. http://dx.doi.org/10.1142/s0129626415500012.
Texto completoGerasoulis, Apostolos, Sesh Venugopal y Tao Yang. "Clustering task graphs for message passing architectures". ACM SIGARCH Computer Architecture News 18, n.º 3b (septiembre de 1990): 447–56. http://dx.doi.org/10.1145/255129.255188.
Texto completoPorat, Talya, Tal Oron-Gilad y Joachim Meyer. "Task-dependent processing of tables and graphs". Behaviour & Information Technology 28, n.º 3 (mayo de 2009): 293–307. http://dx.doi.org/10.1080/01449290701803516.
Texto completoRiabov, Anton y Jay Sethuraman. "Scheduling periodic task graphs with communication delays". ACM SIGMETRICS Performance Evaluation Review 29, n.º 3 (diciembre de 2001): 17–18. http://dx.doi.org/10.1145/507553.507559.
Texto completoLee, Jonathan y Lein F. Lai. "Verifying task-based specifications in conceptual graphs". Information and Software Technology 39, n.º 14-15 (enero de 1998): 913–23. http://dx.doi.org/10.1016/s0950-5849(97)00054-2.
Texto completoLöwe, Welf y Wolf Zimmermann. "Scheduling balanced task-graphs to LogP-machines". Parallel Computing 26, n.º 9 (julio de 2000): 1083–108. http://dx.doi.org/10.1016/s0167-8191(00)00030-2.
Texto completoJain, Kamal Kumar y V. Rajaraman. "Parallelism measures of task graphs for multiprocessors". Microprocessing and Microprogramming 40, n.º 4 (mayo de 1994): 249–59. http://dx.doi.org/10.1016/0165-6074(94)90133-3.
Texto completoLombardi, Michele y Michela Milano. "Allocation and scheduling of Conditional Task Graphs". Artificial Intelligence 174, n.º 7-8 (mayo de 2010): 500–529. http://dx.doi.org/10.1016/j.artint.2010.02.004.
Texto completoLiu, Zhen y Rhonda Righter. "Optimal parallel processing of random task graphs". Journal of Scheduling 4, n.º 3 (2001): 139–56. http://dx.doi.org/10.1002/jos.70.
Texto completoSheikh, Sophiya, Aitha Nagaraju y Mohammad Shahid. "A Parallelized Dynamic Task Scheduling for Batch of Task in a computational grid". International Journal of Computers and Applications 41, n.º 1 (9 de agosto de 2018): 39–53. http://dx.doi.org/10.1080/1206212x.2018.1505018.
Texto completoBnaya, Zahy, Ariel Felner, Dror Fried, Olga Maksin y Solomon Shimony. "Repeated-Task Canadian Traveler Problem". Proceedings of the International Symposium on Combinatorial Search 2, n.º 1 (19 de agosto de 2021): 24–30. http://dx.doi.org/10.1609/socs.v2i1.18197.
Texto completoArcan, Mihael, Sampritha Manjunath, Cécile Robin, Ghanshyam Verma, Devishree Pillai, Simon Sarkar, Sourav Dutta, Haytham Assem, John P. McCrae y Paul Buitelaar. "Intent Classification by the Use of Automatically Generated Knowledge Graphs". Information 14, n.º 5 (12 de mayo de 2023): 288. http://dx.doi.org/10.3390/info14050288.
Texto completoEshaghian, Mary Mehrnoosh. "MAPPING ARBITRARY HETEROGENEOUS TASK GRAPHS ONTO ARBITRARY HETEROGENEOUS SYSTEM GRAPH". International Journal of Foundations of Computer Science 12, n.º 05 (octubre de 2001): 599–628. http://dx.doi.org/10.1142/s0129054101000680.
Texto completoČyras, Vytautas. "Sąvokų „paskirtis", „tikslas", „uždavinys" ir „funkcija" modeliavimas teisėje: ar yra problema?" Lietuvos matematikos rinkinys 44 (17 de diciembre de 2004): 250–55. http://dx.doi.org/10.15388/lmr.2004.31643.
Texto completoWalker, Bruce N. y Michael A. Nees. "Conceptual versus Perceptual Training for Auditory Graphs". Proceedings of the Human Factors and Ergonomics Society Annual Meeting 49, n.º 17 (septiembre de 2005): 1598–601. http://dx.doi.org/10.1177/154193120504901721.
Texto completoRhodes, David L. y Wayne Wolf. "TWO CONP-COMPLETE SCHEDULE ANALYSIS PROBLEMS". International Journal of Foundations of Computer Science 12, n.º 05 (octubre de 2001): 565–80. http://dx.doi.org/10.1142/s0129054101000667.
Texto completoBaron, Lorraine M. "An Authentic Task That Models Quadratics". Mathematics Teaching in the Middle School 20, n.º 6 (febrero de 2015): 334–40. http://dx.doi.org/10.5951/mathteacmiddscho.20.6.0334.
Texto completoDifallah, Djellel, Michele Catasta, Gianluca Demartini y Philippe Cudré-Mauroux. "Scaling-Up the Crowd: Micro-Task Pricing Schemes for Worker Retention and Latency Improvement". Proceedings of the AAAI Conference on Human Computation and Crowdsourcing 2 (5 de septiembre de 2014): 50–58. http://dx.doi.org/10.1609/hcomp.v2i1.13154.
Texto completoTrisedya, Bayu Distiawan, Jianzhong Qi y Rui Zhang. "Entity Alignment between Knowledge Graphs Using Attribute Embeddings". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julio de 2019): 297–304. http://dx.doi.org/10.1609/aaai.v33i01.3301297.
Texto completoBanerjee, Subhankar y Shayok Chakraborty. "Deterministic Mini-batch Sequencing for Training Deep Neural Networks". Proceedings of the AAAI Conference on Artificial Intelligence 35, n.º 8 (18 de mayo de 2021): 6723–31. http://dx.doi.org/10.1609/aaai.v35i8.16831.
Texto completoHuixin Wu, Jianghua Huang y Yingfeng Wang. "Algorithms for Numbering Communication Tasks in Task Graphs". International Journal of Advancements in Computing Technology 4, n.º 16 (30 de septiembre de 2012): 55–63. http://dx.doi.org/10.4156/ijact.vol4.issue16.7.
Texto completoYANG, TAO y APOSTOLOS GERASOULIS. "EXECUTING SCHEDULED TASK GRAPHS ON MESSAGE-PASSING ARCHITECTURES". International Journal of High Speed Computing 08, n.º 03 (septiembre de 1996): 271–94. http://dx.doi.org/10.1142/s012905339600015x.
Texto completoRavindran, R. C., C. Mani Krishna, Israel Koren y Zahava Koren. "Scheduling imprecise task graphs for real-time applications". International Journal of Embedded Systems 6, n.º 1 (2014): 73. http://dx.doi.org/10.1504/ijes.2014.060919.
Texto completoHu, Menglan, Jun Luo, Yang Wang y Bharadwaj Veeravalli. "Adaptive Scheduling of Task Graphs with Dynamic Resilience". IEEE Transactions on Computers 66, n.º 1 (1 de enero de 2017): 17–23. http://dx.doi.org/10.1109/tc.2016.2574349.
Texto completo