Wyniki wyszukiwania dla: LEADER ELECTION

• Topology recognition and leader election in colored networks

  Publikacja

  • D. Dereniowski
  • A. Pelc

  - THEORETICAL COMPUTER SCIENCE - Rok 2016

  Topology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the network, while the result of the second one consists in a single node adopting the label 1 (leader), with all other nodes adopting the label 0 and learning a path to the leader. We consider both these problems in networks whose nodes are equipped with...

  Pełny tekst do pobrania w portalu

• Leader election for anonymous asynchronous agents in arbitrary networks

  Publikacja

  • D. Dereniowski
  • A. Pelc

  - DISTRIBUTED COMPUTING - Rok 2014

  We consider the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical. Hence the only way to elect a leader among agents is by exploiting asymmetries in their initial positions in the graph. Agents do not know the graph or their positions in it, hence they must gain this knowledge by navigating in the graph...

  Pełny tekst do pobrania w serwisie zewnętrznym

• A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence

  Publikacja

  • P. Jacquet
  • C. Knessel
  • W. Szpankowski

  - COMBINATORICS PROBABILITY & COMPUTING - Rok 2014

  We resolve a conjecture proposed by D.E. Knuth concerning a recurrence arising in the satisfiability problem. Knuth's recurrence resembles recurrences arising in the analysis of tries, in particular PATRICIA tries, and asymmetric leader election. We solve Knuth's recurrence exactly and asymptotically, using analytic techniques such as the Mellin transform and analytic depoissonization.

  Pełny tekst do pobrania w serwisie zewnętrznym

• Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model

  Publikacja

  • K. Leckey
  • R. Neininger
  • W. Szpankowski

  - Rok 2013

  Tries are among the most versatile and widely used data structures on words. They are pertinent to the (internal) structure of (stored) words and several splitting procedures used in diverse contexts ranging from document taxonomy to IP addresses lookup, from data compression (i.e., Lempel- Ziv'77 scheme) to dynamic hashing, from partial-match queries to speech recognition, from leader election algorithms to distributed hashing...

• Wiktoria Wojnicz dr hab. inż.

  Osoby

  Zakład Mechaniki Stosowanej i Biomechaniki, Instytut Mechaniki i Konstrukcji Maszyn

  DSc in Mechanics (in the field of Biomechanics)  - Lodz Univeristy of Technology, 2019  PhD in Mechanics (in the field of Biomechanics)  - Lodz Univeristy of Technology, 2009 (with distinction)   Lista publikacji (2009 - ) Publikacje z listy MNiSW: Wojnicz W., Wittbrodt E., Analysis of muscles' behaviour. Part I. The computational model of muscle. Acta of Bioengineering and Biomechanics, Vol. 11, No.4, 2009, s. 15-21 Wojnicz...