weighted dominating set algorithms de akusta dagdeviren (8 resultados)

Condición: New. pp. 112.

Taschenbuch. Condición: Neu. Weighted Dominating Set Algorithms for Wireless Sensor Networks | Using Meta-Heuristic Techniques | Zuleyha Akusta Dagdeviren (u. a.) | Taschenbuch | Englisch | 2021 | LAP LAMBERT Academic Publishing | EAN 9786203304718 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.

Condición: New. Print on Demand pp. 112.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Dominating set is one of the graph theoretical structures and has many important applications such as clustering, intrusion detection and backbone formation in wireless sensor networks; placement of gateways in wireless mesh networks; summarizing multiple documents and selecting queries for information retrieval on the internet. Finding the minimum weighted connected dominating set is an NP-Hard problem. Hence, approximation algorithms and meta-heuristic algorithms can give effective results in polynomial time. In this book, different meta-heuristic algorithms are studied for the minimum weighted connected dominating set problem. 112 pp. Englisch.

Condición: New. PRINT ON DEMAND pp. 112.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Akusta Dagdeviren ZuleyhaZuleyha A. Dagdeviren received the BSc in Comp. Eng. from Izmir Inst. of Tech. in 2010 and her MSc and PhD in Comp. Science from Ege University, Int l Comp. Inst. in 2012 and 2017.Serdar Korukoglu.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Dominating set is one of the graph theoretical structures and has many important applications such as clustering, intrusion detection and backbone formation in wireless sensor networks; placement of gateways in wireless mesh networks; summarizing multiple documents and selecting queries for information retrieval on the internet. Finding the minimum weighted connected dominating set is an NP-Hard problem. Hence, approximation algorithms and meta-heuristic algorithms can give effective results in polynomial time. In this book, different meta-heuristic algorithms are studied for the minimum weighted connected dominating set problem.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 112 pp. Englisch.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Dominating set is one of the graph theoretical structures and has many important applications such as clustering, intrusion detection and backbone formation in wireless sensor networks; placement of gateways in wireless mesh networks; summarizing multiple documents and selecting queries for information retrieval on the internet. Finding the minimum weighted connected dominating set is an NP-Hard problem. Hence, approximation algorithms and meta-heuristic algorithms can give effective results in polynomial time. In this book, different meta-heuristic algorithms are studied for the minimum weighted connected dominating set problem.