المؤلفون: Siqi Xia, Sutharshan Rajasegarar, Lei Pan, Christopher Leckie, Sarah M. Erfani, Jeffrey Chan

المصدر: IEEE Access, Vol 12, Pp 121971-121982 (2024)

مصطلحات موضوعية: Anomalies in graphs, generative adversarial networks, k-hop neighborhood sampling, deep learning, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

وصف الملف: electronic resource

Relation: https://ieeexplore.ieee.org/document/10662895/; https://doaj.org/toc/2169-3536

URL الوصول: https://doaj.org/article/c2d5bbab100e4f9f84685f1fc17dba18

المؤلفون: Filtser, Omrit, Krohn, Erik, Nilsson, Bengt J., Rieck, Christian, Schmidt, Christiane

المصدر: LATIN 2024 Lecture Notes in Computer Science. :288-302

مصطلحات موضوعية: Art Gallery problem, k-hop visibility, polyominoes, VC dimension, approximation, k-hop dominating set

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-69968

المؤلفون: Ziyi Chen, Kaiyan Dai, Xing Jin, Liqin Hu, Yongheng Wang

المصدر: Mathematics; Volume 11; Issue 14; Pages: 3037

مصطلحات موضوعية: public goods games, best-shot, aspiration, k -hop, access cost

وصف الملف: application/pdf

Relation: Network Science; https://dx.doi.org/10.3390/math11143037

الاتاحة: https://doi.org/10.3390/math11143037

المؤلفون: Xian Tang, Junfeng Zhou, Yunyu Shi, Xiang Liu, Keng Lin

المصدر: Applied Sciences; Volume 13; Issue 6; Pages: 3470

مصطلحات موضوعية: graph data management, k -hop reachability, vertex cover

جغرافية الموضوع: agris

وصف الملف: application/pdf

Relation: Computing and Artificial Intelligence; https://dx.doi.org/10.3390/app13063470

الاتاحة: https://doi.org/10.3390/app13063470

المؤلفون: Böhm, Martin, Hoeksma, Ruben, Megow, Nicole, Nölke, Lukas, Simon, Bertrand

المساهمون: Martin Böhm and Ruben Hoeksma and Nicole Megow and Lukas Nölke and Bertrand Simon

مصطلحات موضوعية: k-hop Steiner tree, dynamic programming, bounded treewidth

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.18

الاتاحة: https://doi.org/10.4230/LIPIcs.MFCS.2020.18
https://nbn-resolving.org/urn:nbn:de:0030-drops-126870
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.18

المؤلفون: Ming Du, Anping Yang, Junfeng Zhou, Xian Tang, Ziyang Chen, Yanfei Zuo

المصدر: IEEE Access, Vol 7, Pp 172110-172122 (2019)

مصطلحات موضوعية: Graph data management, reachability queries processing, k-hop reachability, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

وصف الملف: electronic resource

Relation: https://ieeexplore.ieee.org/document/8917635/; https://doaj.org/toc/2169-3536

URL الوصول: https://doaj.org/article/7e46f14564414704b3afec172ec64175

المؤلفون: Hiroyuki Ohsaki, Ryo Nakamura

المصدر: Journal of Information Processing. 2020, 28:570

المؤلفون: Böhm, Martin, Hoeksma, Ruben, Megow, Nicole, Nölke, Lukas, Simon, Bertrand

المساهمون: Centre de Calcul de l'IN2P3 (CC-IN2P3), Institut National de Physique Nucléaire et de Physique des Particules du CNRS (IN2P3)-Centre National de la Recherche Scientifique (CNRS)

المصدر: SIAM J.Discrete Math. ; https://hal.science/hal-03701406 ; SIAM J.Discrete Math., 2022, 36 (2), pp.1249-1273. ⟨10.1137/21M1425487⟩

مصطلحات موضوعية: k-hop Steiner tree, hop-constrained, dynamic programming, bounded treewidth, [PHYS.MPHY]Physics [physics]/Mathematical Physics [math-ph]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2003.05699; hal-03701406; https://hal.science/hal-03701406; ARXIV: 2003.05699; INSPIRE: 2098791

الاتاحة: https://hal.science/hal-03701406
https://doi.org/10.1137/21M1425487

المؤلفون: Andreica, Mugurel Ionut, Tapus, Nicolae

المساهمون: Parallel and Distributed Systems Laboratory Bucarest, University Politehnica of Bucarest

المصدر: Proceedings of the 12th IEEE International Symposium on Consumer Electronics (ISCE) (ISBN: 978-1-4244-2422-1) ; 12th IEEE International Symposium on Consumer Electronics (ISCE) ; https://hal.archives-ouvertes.fr/hal-00786043 ; 12th IEEE International Symposium on Consumer Electronics (ISCE), Apr 2008, Vilamoura, Portugal. pp.169-172, ⟨10.1109/ISCE.2008.4559464⟩

مصطلحات موضوعية: maximum reliability, k-hop multicasting, k-station placement problem, tree network, reliable multicast, ACM E.1, F.2, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

جغرافية الموضوع: Vilamoura, Portugal

Relation: hal-00786043; https://hal.archives-ouvertes.fr/hal-00786043; https://hal.archives-ouvertes.fr/hal-00786043/document; https://hal.archives-ouvertes.fr/hal-00786043/file/Andreica_Tapus-Max_Reliab_K-Hop_Mcast_Trees.pdf

الاتاحة: https://hal.archives-ouvertes.fr/hal-00786043
https://hal.archives-ouvertes.fr/hal-00786043/document
https://hal.archives-ouvertes.fr/hal-00786043/file/Andreica_Tapus-Max_Reliab_K-Hop_Mcast_Trees.pdf
https://doi.org/10.1109/ISCE.2008.4559464

مصطلحات موضوعية: k-hop Steiner tree, Dynamic programming, Network design

URL الوصول: https://explore.openaire.eu/search/publication?articleId=dris___00893::fd9215c37aea935b65b507315e791972
https://arxiv.org/abs/2003.05699

المؤلفون: Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon

المساهمون: Digital Society Institute, Mathematics of Operations Research

المصدر: SIAM journal on discrete mathematics, 36(2), 1249-1273. Society for Industrial and Applied Mathematics Publications

مصطلحات موضوعية: dynamic programming, FOS: Computer and information sciences, k-hop Steiner tree, General Mathematics, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), bounded treewidth, hop-constrained

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e414bebd5d8ef969144b9ae0170d8497
http://arxiv.org/abs/2003.05699

المؤلفون: Khateri K., Pourgholi M., Montazeri M., Sabattini L.

المساهمون: Khateri, K., Pourgholi, M., Montazeri, M., Sabattini, L.

مصطلحات موضوعية: Communication delay, Connectivity maintenance, Distributed robotic system, k-hop routing

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000510946100010; volume:51; firstpage:110; lastpage:121; numberofpages:12; journal:EUROPEAN JOURNAL OF CONTROL; http://hdl.handle.net/11380/1185840; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85063311520; http://www.journals.elsevier.com/european-journal-of-control

الاتاحة: http://hdl.handle.net/11380/1185840
https://doi.org/10.1016/j.ejcon.2019.06.008
http://www.journals.elsevier.com/european-journal-of-control

المؤلفون: Mahdi Pourgholi, Koresh Khateri, Mohsen Montazeri, Lorenzo Sabattini

مصطلحات موضوعية: 0209 industrial biotechnology, Computer science, Distributed computing, Locality, General Engineering, Communication delay, Connectivity maintenance, Distributed robotic systems, k-hop routing, Topology (electrical circuits), 02 engineering and technology, Blocking (computing), 020901 industrial engineering & automation, Power iteration, Path (graph theory), 0202 electrical engineering, electronic engineering, information engineering, Robot, 020201 artificial intelligence & image processing, Disconnection, Routing (electronic design automation)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14a5e72bfd3d93f9895f3d39859f0700
http://www.journals.elsevier.com/european-journal-of-control

المؤلفون: Biró, Csaba

المساهمون: Kozsik, Tamás, Kusper, Gábor

مصطلحات موضوعية: Műszaki tudományok/Informatikai tudományok, Wireless Sensor Networks, Formal methods, SAT, SMT, OMT, directed graph, Black-and- White 2-SAT, BaW 1.0, Puli, k-hop based environment, communication graph, communication redundancy, WCGD, RCGD, WRCGD, CGR, WCGR, Informatika D. I./Az informatika alapjai és módszerei, vezeték nélküli szenzorhálózatok, formális módszerek, irányított gráf, k-hop-os környezet, kommunikációs gráf, kommunikációs redundancia, gráf alapú metrikák

وصف الملف: application/pdf

Relation: http://hdl.handle.net/10831/44509; elte:10.15476/ELTE.2019.163; elte:30938086; https://opac.elte.hu/Record/opac-EUL01-984172; LOMS: https://edit.elte.hu/xmlui/bitstream/10831/44509/1/BCs_PhD_diss_2019.pdf; LOMS: https://edit.elte.hu/xmlui/bitstream/10831/44509/2/BCs_PhD_tezis_2019.pdf; LOMS: https://edit.elte.hu/xmlui/bitstream/10831/44509/3/BCs_PhD_theses_2019.pdf

الاتاحة: http://hdl.handle.net/10831/44509
https://opac.elte.hu/Record/opac-EUL01-984172

المؤلفون: Coelho, Rafael Santos

Thesis Advisors: Wakabayashi, Yoshiko

مصطلحات موضوعية: Algoritmos de aproximação, Approximation algorithms, Complexidade computacional, Computational complexity, Conjunto dominante conexo de k-saltos, Inapproximability threshold, K-disruptive separator, K-hop connected dominating set, Limiar de inaproximabilidade, Poliedro, Polyhedra, Separador k-disruptivo minimal

وصف الملف: application/pdf

الاتاحة: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-27062017-101521/

المؤلفون: Rafael Santos Coelho

Thesis Advisors: Yoshiko Wakabayashi, Manoel Bezerra Campêlo Neto, Aritanan Borges Garcia Gruber, Orlando Lee, Mário Leston Rey

المصدر: Biblioteca Digital de Teses e Dissertações da USPUniversidade de São PauloUSP.

مصطلحات موضوعية: Algoritmos de aproximação, Complexidade computacional, Conjunto dominante conexo de k-saltos, Limiar de inaproximabilidade, Poliedro, Separador k-disruptivo minimal, Approximation algorithms, Computational complexity, Inapproximability threshold, K-disruptive separator, K-hop connected dominating set, Polyhedra

الاتاحة: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-27062017-101521/

المؤلفون: LONG, Jun, DONG, Mianxiong, トウ, メンユウ, 董, 冕雄, OTA, Kaoru, 太田, 香, オオタ, カオル, LIU, Anfeng

مصطلحات موضوعية: Wireless Sensor Networks, TDMA, load balancing, lifetime, k-hop network

Time: 007

وصف الملف: application/pdf

Relation: IEEE Systems Journal; 11; 868; 877; https://muroran-it.repo.nii.ac.jp/record/9607/files/IEEESJ_11_2_868_877.pdf

الاتاحة: https://muroran-it.repo.nii.ac.jp/record/9607/files/IEEESJ_11_2_868_877.pdf

المؤلفون: Chang, Wei-yi

Thesis Advisors: JUN-HONG LIN, LI-XING YAN, CHONG-MING HUANG, WEI-GUANG LAI, XIAO-GUANG WU

مصطلحات موضوعية: k-hop

وصف الملف: application/pdf

الاتاحة: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0722110-155800

المؤلفون: Mao, Guoqiang, Zhang, Zijie, Anderson, Brian

المصدر: IEEE Communications Letters

مصطلحات موضوعية: Keywords: Approximate analytical results, Connection function, Connection model, k-hop connection, Recursive formula, Poisson distribution, Recursive functions, Sensor networks, Wireless sensor networks, Probability k-hop connection, Random connection model

Relation: http://hdl.handle.net/1885/58441; https://openresearch-repository.anu.edu.au/bitstream/1885/58441/5/10Anderson_Probability_k-Hop.pdf.jpg; https://openresearch-repository.anu.edu.au/bitstream/1885/58441/7/01_Mao_Probability_of_k-Hop_2010.pdf.jpg

الاتاحة: http://hdl.handle.net/1885/58441
https://doi.org/10.1109/LCOMM.2010.092310.101298
https://openresearch-repository.anu.edu.au/bitstream/1885/58441/5/10Anderson_Probability_k-Hop.pdf.jpg
https://openresearch-repository.anu.edu.au/bitstream/1885/58441/7/01_Mao_Probability_of_k-Hop_2010.pdf.jpg

المؤلفون: Ta, Xiaoyuan, Mao, Guoqiang, Anderson, Brian

المصدر: IEEE Communications Letters

مصطلحات موضوعية: Keywords: Computer simulation, Poisson distribution, Probability, Analytical equation, K hop neighbors, K-hop connection, Poisson process, Wireless sensor networks K-hop connection, Wireless sensor networks

Relation: http://hdl.handle.net/1885/54090; https://openresearch-repository.anu.edu.au/bitstream/1885/54090/5/probability_of_k-hop5.pdf.jpg; https://openresearch-repository.anu.edu.au/bitstream/1885/54090/7/01_Ta_On_the_probability_of_k-hop_2007.pdf.jpg

الاتاحة: http://hdl.handle.net/1885/54090
https://doi.org/10.1109/LCOMM.2007.070569
https://openresearch-repository.anu.edu.au/bitstream/1885/54090/5/probability_of_k-hop5.pdf.jpg
https://openresearch-repository.anu.edu.au/bitstream/1885/54090/7/01_Ta_On_the_probability_of_k-hop_2007.pdf.jpg