Suchergebnisse - "distributed approximation algorithm"

An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs

Autoren: Sayaka Kamei Tomoko Izumi Yukiko Yamauchi

Quelle: Theoretical Computer Science. 615:102-119

Schlagwörter: Unit disk graph, 0202 electrical engineering, electronic engineering, information engineering, Unfair distributed daemon, Minimum connected dominating set, Distributed approximation algorithm, Safe convergence, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Self-stabilization, Theoretical Computer Science, Computer Science(all)

Deviation Estimation between Distributed Data Streams

Autoren: Anceaume, Emmanuelle Busnel, Yann

Weitere Verfasser: Anceaume, Emmanuelle Busnel, Yann

Quelle: 2014 Tenth European Dependable Computing Conference. :35-45

Schlagwörter: distributed approximation algorithm, Data stream model, DDoS attacks, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, correlation metric, 3. Good health

Dateibeschreibung: application/pdf

Zugangs-URL: http://hal-institut-mines-telecom.archives-ouvertes.fr/docs/00/99/87/02/PDF/PID3096993.pdf
https://hal.science/hal-00998702v1
https://hal.science/hal-00998702v1/document
https://doi.org/10.1109/edcc.2014.27
http://ieeexplore.ieee.org/document/6821086/
https://ieeexplore.ieee.org/document/6821086/
https://dblp.uni-trier.de/db/conf/edcc/edcc2014.html#AnceaumeB14
https://doi.org/10.1109/EDCC.2014.27
https://hal.archives-ouvertes.fr/hal-00998702/document
https://hal.archives-ouvertes.fr/hal-00998702

Semi-asynchronous and distributed weighted connected dominating set algorithms for wireless sensor networks

Autoren: Erciyes K. Dagdeviren O. Tse S.

Quelle: Computer Standards & Interfaces. 42:143-156

Schlagwörter: Backbone formation, Weighted connected dominating set, 0202 electrical engineering, electronic engineering, information engineering, Distributed approximation algorithm, 02 engineering and technology, 16. Peace & justice, Wireless sensor networks

Zugangs-URL: https://dblp.uni-trier.de/db/journals/csi/csi42.html#DagdevirenET15
https://doi.org/10.1016/j.csi.2015.05.005
https://www.sciencedirect.com/science/article/pii/S0920548915000677
http://netos.ube.ege.edu.tr/source/publications/csi15.pdf
https://hdl.handle.net/11454/17339
https://doi.org/10.1016/j.csi.2015.05.005

Lightweight Metric Computation for Distributed Massive Data Streams

Autoren: Anceaume, Emmanuelle Busnel, Yann Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE) et al.

Weitere Verfasser: Anceaume, Emmanuelle Busnel, Yann Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE) et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783662556955

Schlagwörter: statistical metric, [INFO.INFO-DC]Computer Science [cs]/Distributed, distributed approximation algorithm, Data stream model, and Cluster Computing [cs.DC], [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], [INFO]Computer Science [cs], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO] Computer Science [cs], Parallel, correlation metric

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.archives-ouvertes.fr/hal-01634353/file/ab-tldks2017.pdf
https://hal.science/hal-01634353v1/document
https://hal.science/hal-01634353v1
https://doi.org/10.1007/978-3-662-55696-2_1
https://link.springer.com/content/pdf/10.1007%2F978-3-662-55696-2_1.pdf
https://hal.archives-ouvertes.fr/hal-01634353/document
https://rd.springer.com/chapter/10.1007/978-3-662-55696-2_1
https://doi.org/10.1007/978-3-662-55696-2_1
https://link.springer.com/chapter/10.1007%2F978-3-662-55696-2_1
https://hal.archives-ouvertes.fr/hal-01634353

A fast distributed approximation algorithm for minimum spanning trees

Autoren: Maleq Khan Gopal Pandurangan The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Maleq Khan Gopal Pandurangan The Pennsylvania State University CiteSeerX Archives

Quelle: http://staff.vbi.vt.edu/maleq/papers/disc.pdf.

Schlagwörter: Distributed Approximation Algorithm, Minimum Spanning Tree

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.171; http://staff.vbi.vt.edu/maleq/papers/disc.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.171
http://staff.vbi.vt.edu/maleq/papers/disc.pdf

Approximation Algorithms for Channel Allocation Problems in Broadcast Networks

Autoren: Rajiv Gandhi The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Rajiv Gandhi The Pennsylvania State University CiteSeerX Archives

Quelle: http://crab.rutgers.edu/~rajivg/publications/journal/networks06.ps.

Schlagwörter: channel allocation problem, edge partitioning problem, distributed approximation algorithm

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.5743; http://crab.rutgers.edu/~rajivg/publications/journal/networks06.ps

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.5743
http://crab.rutgers.edu/~rajivg/publications/journal/networks06.ps

Exploiting user mobility for wireless content delivery

Autoren: Poularakis, K. Tassiulas, L.

Quelle: http://www.scopus.com/inward/record.url?eid=2-s2.0-84890413562&partnerID=40&md5=eec9d4e3471527dd898ab5fc988bec4b.

Schlagwörter: Communication cell, Content delivery, Discrete time Markov chains, Distributed approximation algorithm, File delivery, Large deviations, Optimal solutions, Systematic experiment, Approximation algorithms, Information theory, Base stations

Relation: http://hdl.handle.net/11615/32421

Verfügbarkeit: http://hdl.handle.net/11615/32421
https://doi.org/10.1109/ISIT.2013.6620380

Efficient Distributed Approximation Algorithms via Probabilistic Tree Embeddings

Autoren: Urangan Kunal Talwar The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Urangan Kunal Talwar The Pennsylvania State University CiteSeerX Archives

Quelle: http://staff.vbi.vt.edu/maleq/papers/distapprox.pdf.

Schlagwörter: Distributed Approximation Algorithm, Network Optimization, Probabilistic Tree Embedding, Least Element Lists, Generalized Steiner Forest Problem

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.1320; http://staff.vbi.vt.edu/maleq/papers/distapprox.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.1320
http://staff.vbi.vt.edu/maleq/papers/distapprox.pdf