Stage-oe-small.jpg

Verteilte Algorithmen/en

Aus Aifbportal
Wechseln zu:Navigation, Suche

Distributed Algorithms

Publications Belonging to the Area of Research

Article
Jürgen Branke, P. Funes, F. Thiele
Evolving en-route caching strategies for the internet
Applied Soft Computing Journal, 7, (3), pages 890-898, 2007
(Details)


↑ top

inproceedings
Victor Anthony Arrascue Ayala, Polina Koleva, Anas Alzogbi, Matteo Cossu, Michael Färber, Patrick Philipp, Guilherme Schievelbein, Io Taxidou, Georg Lausen
Relational Schemata for Distributed SPARQL Query Processing
Proceedings of the International Workshop on Semantic Big Data (SBD∂SIGMOD'19), ACM
(Details)


Sabrina Merkel, Sanaz Mostaghim, Hartmut Schmeck
A Study of Mobility in Ad Hoc Networks and Its Effects on a Hop Count Based Distance Estimation
International Conference on New Technologies, Mobility and Security (NTMS), pages: 1-5, IEEE Xplore®, Mai, 2012
(Details)


Christoph Tempich, Steffen Staab, A. Wranik
REMINDIN': Semantic Query Routing in Peer-to-Peer Networks Based on Social Metaphors
In W3C, Proceedings of the 13th International World Wide Web Conference (WWW 2004), pages: 640-649, ACM, New York, USA, Mai, 2004
(Details)


Christoph Schmitz, Steffen Staab, Christoph Tempich
Socialisation in Peer-to-Peer Knowledge Management
In K. Tochtermann and H. Maurer, Proceedings of the 4th International Conference on Knowledge Management (I-KNOW'04), pages: 35-42, Journal of Universal Computer Science (J.UCS), Graz, Austria, Juni, 2004
(Details)


↑ top

incollection
Sabrina Merkel, Sanaz Mostaghim, Hartmut Schmeck
Distributed Geometric Distance Estimation in Ad Hoc Networks
In Xiang-Yang Li, Symeon Papavassiliou, and Stefan Ruehrup, Ad-hoc, Mobile, and Wireless Networks, ch. 3, pages 28-41, Springer, Lecture Notes in Computer Science, Vol. 7363, Berlin Heidelberg, Juli, 2012
(Details)


Christoph Tempich, Steffen Staab
Semantic Query Routing in Unstructured Networks Using Social Metaphors
In S. Stuckenschmidt, S. Staab, Semantic Web and Peer-to-Peer, pages 105--122, Springer, 2005
(Details)


↑ top