Gotowa bibliografia na temat „Node scheduling”
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 „Node scheduling”.
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 "Node scheduling"
Wang, Zhangquan, Yourong Chen, Banteng Liu, Haibo Yang, Ziyi Su i Yunkai Zhu. "A sensor node scheduling algorithm for heterogeneous wireless sensor networks". International Journal of Distributed Sensor Networks 15, nr 1 (styczeń 2019): 155014771982631. http://dx.doi.org/10.1177/1550147719826311.
Pełny tekst źródłaHuang, Yu, Wanxing Sheng, Peipei Jin, Baicuan Nie, Meikang Qiu i Guangquan Xu. "A Node-Oriented Discrete Event Scheduling Algorithm Based on Finite Resource Model". Journal of Organizational and End User Computing 31, nr 3 (lipiec 2019): 67–82. http://dx.doi.org/10.4018/joeuc.2019070104.
Pełny tekst źródłaGupta, Gagan R., Sujay Sanghavi i Ness B. Shroff. "Node weighted scheduling". ACM SIGMETRICS Performance Evaluation Review 37, nr 1 (15.06.2009): 97–108. http://dx.doi.org/10.1145/2492101.1555361.
Pełny tekst źródłaFeng, Juan, i Hongwei Zhao. "Energy-Balanced Multisensory Scheduling for Target Tracking in Wireless Sensor Networks". Sensors 18, nr 10 (22.10.2018): 3585. http://dx.doi.org/10.3390/s18103585.
Pełny tekst źródłaEt. al., G. Joel Sunny Deol,. "Hadoop Job Scheduling Using Improvised Ant Colony Optimization". Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, nr 2 (10.04.2021): 3417–24. http://dx.doi.org/10.17762/turcomat.v12i2.2403.
Pełny tekst źródłaXu, Yun, Wanguo Jiao i Mengqiu Tian. "Energy-Efficient Connected-Coverage Scheme in Wireless Sensor Networks". Sensors 20, nr 21 (28.10.2020): 6127. http://dx.doi.org/10.3390/s20216127.
Pełny tekst źródłaZhu, Li, Chunxiao Fan, Huarui Wu i Zhigang Wen. "A Coverage Algorithm based on Key Node Scheduling". International Journal of Online Engineering (iJOE) 11, nr 9 (29.10.2015): 67. http://dx.doi.org/10.3991/ijoe.v11i9.5068.
Pełny tekst źródłaLiu, Weirong, Yun He, Xiaoyong Zhang, Fu Jiang, Kai Gao i Jianming Xiao. "Energy-Efficient Node Scheduling Method for Cooperative Target Tracking in Wireless Sensor Networks". Mathematical Problems in Engineering 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/627479.
Pełny tekst źródłaFu, Wentao, Xilun Luo, Yuanfa Ji i Xiyan Sun. "Node-Subset Scheduling with a Subset-Reset Mechanism for the Decoding Algorithm of Nonbinary LDPC Codes". Mobile Information Systems 2021 (10.05.2021): 1–16. http://dx.doi.org/10.1155/2021/5548091.
Pełny tekst źródłaAbror, Gezaq, Rusminto Tjatur Widodo i M. Udin Harun Al Rasyid. "Dynamic Sleep Scheduling on Air Pollution Levels Monitoring with Wireless Sensor Network". EMITTER International Journal of Engineering Technology 5, nr 2 (13.01.2018): 209–33. http://dx.doi.org/10.24003/emitter.v5i2.185.
Pełny tekst źródłaRozprawy doktorskie na temat "Node scheduling"
Tian, Di. "Node activity scheduling schemes in large-scale wireless sensor networks". Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/29266.
Pełny tekst źródłaKhasawneh, Samer Fayiz. "Static Scheduling for Synchronous Data Flow Graphs". University of Akron / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=akron1184612284.
Pełny tekst źródłaSEETHARAMAN, SUMATHI. "SELF-ORGANIZED SCHEDULING OF NODE ACTIVITY IN LARGE-SCALE SENSOR NETWORKS". University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1092939502.
Pełny tekst źródłaPazand, Babak. "Location-free node scheduling schemes for energy efficient, fault tolerant and adaptive sensing in wireless sensor networks". University of Western Australia. School of Computer Science and Software Engineering, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0185.
Pełny tekst źródłaMahfoudh, Saoucene. "Energy efficiency in wireless ad hoc and sensor networks : routing, node activity scheduling and cross-layering". Phd thesis, Université Pierre et Marie Curie - Paris VI, 2010. http://tel.archives-ouvertes.fr/tel-00757251.
Pełny tekst źródłaFan, Yuqi. "Burst Scheduling, Grooming and QoS Provisioning in Optical Burst-Switched Networks". Wright State University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=wright1239828363.
Pełny tekst źródłaKhan, Farhan, i Muhammad Umer Khan and Noman Ellahi. "Ad Hoc Network Nodes Scheduling using DS and FH CDMA". Thesis, Blekinge Tekniska Högskola, Sektionen för ingenjörsvetenskap, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4784.
Pełny tekst źródłaSchönemann, René [Verfasser], Jürgen [Akademischer Betreuer] Siegmann, Jürgen [Gutachter] Siegmann i Thomas [Gutachter] Siefer. "Scheduling rail freight node operations through a slot allocation approach / René Schönemann ; Gutachter: Jürgen Siegmann, Thomas Siefer ; Betreuer: Jürgen Siegmann". Berlin : Technische Universität Berlin, 2016. http://d-nb.info/1156181763/34.
Pełny tekst źródłaBountourelis, Theologos. "Efficient pac-learning for episodic tasks with acyclic state spaces and the optimal node visitation problem in acyclic stochastic digaphs". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/28144.
Pełny tekst źródłaCommittee Chair: Reveliotis, Spyros; Committee Member: Ayhan, Hayriye; Committee Member: Goldsman, Dave; Committee Member: Shamma, Jeff; Committee Member: Zwart, Bert.
Bekono, Nina Pelagie. "Impact du changement du protocole de routage dans un réseau". Thesis, Université Clermont Auvergne (2017-2020), 2018. http://www.theses.fr/2018CLFAC058/document.
Pełny tekst źródłaRouting protocols in networks may change for many reasons: detection of a particular event, planned or unplanned change of topology, mobility of nodes, version obsolescence, etc. As these changes can not be simultaneously detected or taken into account by all nodes of the network, it is necessary to consider the case where some nodes use the initial routing protocol, while others have migrated to the new routing protocol. The work of this thesis deals with the problem of routing loops that may appear in this context, and which considerably degrade the performance of the network. We propose node scheduling solutions to control migration to avoid these loops. First, we consider the context of static networks and centralized protocols with the particular case of changing metrics. We propose two centralized avoidance solutions: SCH-m (minor improvement of an existing heuristic), and ACH (new contribution), based on the identification of the routing loops in the strongly connected components contained in the union of the two routing protocols. We accelerate the migration of the network by a step-by-step merge operation of the different transitions produced. Second, we evolve towards the distributed protocols while preserving the static context of the network, and consider the particular case of the withdrawal or breakdown of a node. We also propose two solutions: RTH-d (minor improvement of an existing heuristic) and DLF (new contribution for loops of size 2) based on message exchange of nodes for both failure detection and for migration notification. Thirdly, we consider the context of nodes mobility, and study the performance of DLF- k (improved version of DLF which takes into account loops of size less than or equal to k, with k >= 2) on two types of applications: applications with a single mobile node that is the destination, and applications with a group of mobile nodes
Książki na temat "Node scheduling"
United Nations Commission on International Trade Law. Provisional agenda, annotations thereto and scheduling of meetings of the twenty-fifth session: Note by the Secretariat. [New York]: United Nations General Assembly, 1992.
Znajdź pełny tekst źródłaUnited Nations Commission on International Trade Law. Provisional agenda, annotations thereto and scheduling of meetings of the twenty-seventh session: Note by the Secretariat. [New York]: United Nations General Assembly, 1994.
Znajdź pełny tekst źródłaYuan lai shou zhang zhe yang wan. Xinbei Shi Xindian Qu: Ye ren wen hua gu fen you xian gong si, 2014.
Znajdź pełny tekst źródłatranslator, Chen Huili, red. Maikenxi de bi ji shu: Ding jian gu wen de si kao, shu xie ji qiao = The McKinsey way : techniques for taking notes on problem-solving = Makkinzē no erīto wa nōto ni nani o kaite iru noka : toppu konsarutanto no kangaeru gijutsu kaku gijutsu. 2015.
Znajdź pełny tekst źródłaCzęści książek na temat "Node scheduling"
Kesidis, George. "Bandwidth Scheduling for a Single Node". W ATM Network Performance, 35–53. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4757-4568-9_3.
Pełny tekst źródłaKesidis, George. "Bandwidth Scheduling for a Single Node". W ATM Network Performance, 41–68. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-4559-0_3.
Pełny tekst źródłaPereira, Romain, Adrien Roussel, Patrick Carribault i Thierry Gautier. "Communication-Aware Task Scheduling Strategy in Hybrid MPI+OpenMP Applications". W OpenMP: Enabling Massive Node-Level Parallelism, 197–210. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-85262-7_14.
Pełny tekst źródłaTsujita, Yuki, i Toshio Endo. "Data Driven Scheduling Approach for the Multi-node Multi-GPU Cholesky Decomposition". W Job Scheduling Strategies for Parallel Processing, 69–82. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61756-5_4.
Pełny tekst źródłaWan, Michael, Reagan Moore, George Kremenek i Ken Steube. "A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm". W Job Scheduling Strategies for Parallel Processing, 48–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0022287.
Pełny tekst źródłaNakamura, Fabíola Guerra, Frederico Paiva Quintão, Gustavo Campos Menezes i Geraldo Robson Mateus. "An Optimal Node Scheduling for Flat Wireless Sensor Networks". W Networking - ICN 2005, 475–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31956-6_56.
Pełny tekst źródłaJiang, Jie, Zhen Song, Heying Zhang i Wenhua Dou. "On Lightweight Node Scheduling Scheme for Wireless Sensor Networks". W Distributed Computing – IWDC 2005, 318–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11603771_35.
Pełny tekst źródłaXiangyu, Wang. "Node Wake-Up Scheduling Mechanism for Delay Tolerant Networks". W Advances in Computer Science, Intelligent System and Environment, 495–500. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23756-0_79.
Pełny tekst źródłaHuang, Liang. "Energy Harvesting Sensor Node Scheduling in Wireless Sensor Networks". W Encyclopedia of Wireless Networks, 411–14. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-319-78262-1_260.
Pełny tekst źródłaHuang, Liang. "Energy Harvesting Sensor Node Scheduling in Wireless Sensor Networks". W Encyclopedia of Wireless Networks, 1–4. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-32903-1_260-1.
Pełny tekst źródłaStreszczenia konferencji na temat "Node scheduling"
Gupta, Gagan R., Sujay Sanghavi i Ness B. Shroff. "Node weighted scheduling". W the eleventh international joint conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1555349.1555361.
Pełny tekst źródłaAbawajy, Jemal H., Saeid Nahavandi i Fahed Al-Neyadi. "Sensor Node Activity Scheduling Approach". W 2007 International Conference on Multimedia and Ubiquitous Engineering (MUE'07). IEEE, 2007. http://dx.doi.org/10.1109/mue.2007.190.
Pełny tekst źródłaWu, Yue, Zhongru Wang, Qiang Ruan, Jinyu Shi i Binxing Fang. "Node Scheduling: A Blockchain-Based Node Selection Approach on Sapiens Chain". W 2019 IEEE International Conference on Big Data and Smart Computing (BigComp). IEEE, 2019. http://dx.doi.org/10.1109/bigcomp.2019.8679303.
Pełny tekst źródłaZhang, Zeqi, Chunxiao Jiang, Song Guo, Zuyao Ni i Yong Ren. "Optimal Satellite Scheduling with Critical Node Analysis". W 2017 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2017. http://dx.doi.org/10.1109/wcnc.2017.7925895.
Pełny tekst źródłaSarkar, Chayan, R. Venkatesha Prasad, Raj Thilak Rajan i Koen Langendoen. "Sleeping Beauty: Efficient Communication for Node Scheduling". W 2016 IEEE 13th International Conference on Mobile Ad Hoc and Sensor Systems (MASS). IEEE, 2016. http://dx.doi.org/10.1109/mass.2016.018.
Pełny tekst źródłaTak, Sungwoo, Hangeul Kim, Donglyul Kim i Yougyung Kim. "Energy-Aware Scheduling for Sensor Node Platforms". W 2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT). IEEE, 2014. http://dx.doi.org/10.1109/pdcat.2014.18.
Pełny tekst źródłaHakim, Hela, Wessam Ajib i Hatem Boujemaa. "Scheduling schemes for N-node cooperative networks". W 2010 17th International Conference on Telecommunications (ICT 2010). IEEE, 2010. http://dx.doi.org/10.1109/ictel.2010.5478648.
Pełny tekst źródłaJi, Bo, i Jie Wu. "Node-based scheduling with provable evacuation time". W 2015 49th Annual Conference on Information Sciences and Systems (CISS). IEEE, 2015. http://dx.doi.org/10.1109/ciss.2015.7086428.
Pełny tekst źródłaJun, QIN, SONG Yanyan i ZONG Ping. "Research on Task Scheduling Strategy based on the Trustworthiness of MapReduce". W International Conference on AI, Machine Learning and Applications (AIMLA 2021). Academy and Industry Research Collaboration Center (AIRCC), 2021. http://dx.doi.org/10.5121/csit.2021.111304.
Pełny tekst źródłaSnoussi, Hichem, i Cedric Richard. "Information-theoretic node scheduling in collaborative sensor networks". W 2007 9th International Symposium on Signal Processing and Its Applications (ISSPA). IEEE, 2007. http://dx.doi.org/10.1109/isspa.2007.4555503.
Pełny tekst źródła