• English
    • Ελληνικά
  • English 
    • English
    • Ελληνικά
  • Login
Browsing by Subject 
  •   Home
  • Browsing by Subject
  •   Home
  • Browsing by Subject
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browsing by Subject "Iterative strategy"

  • 0-9
  • Α
  • Β
  • Γ
  • Δ
  • Ε
  • Ζ
  • Η
  • Θ
  • Ι
  • Κ
  • Λ
  • Μ
  • Ν
  • Ξ
  • Ο
  • Π
  • Ρ
  • Σ
  • Τ
  • Υ
  • Φ
  • Χ
  • Ψ
  • Ω
  • A
  • B
  • C
  • D
  • E
  • F
  • G
  • H
  • I
  • J
  • K
  • L
  • M
  • N
  • O
  • P
  • Q
  • R
  • S
  • T
  • U
  • V
  • W
  • X
  • Y
  • Z

Sort by:

Order:

Results:

Now showing items 1-8 of 8

  • title
  • submit date
  • accessioned date
  • ascending
  • descending
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
    • Conference Object  

      Distributed function calculation via linear iterations in the presence of malicious agents - Part I: Attacking the network 

      Sundaram, S.; Hadjicostis, Christoforos N. (2008)
      We consider the problem of distributed function calculation in the presence of faulty or malicious agents. In particular, we consider a setup where each node has an initial value and the goal is for (a subset of) the nodes ...

    • Conference Object  

      Distributed function calculation via linear iterations in the presence of malicious agents - Part II: Overcoming malicious behavior 

      Sundaram, S.; Hadjicostis, Christoforos N. (2008)
      Given a network of interconnected nodes, each with a given initial value, we develop a distributed strategy that enables some or all of the nodes to calculate any arbitrary function of these initial values, despite the ...

    • Conference Object  

      Distributed stopping for average consensus in directed graphs via a randomized event-triggered strategy 

      Manitara, N. E.; Hadjicostis, Christoforos N. (IEEE Computer Society, 2014)
      We consider how an iterative strategy for asymptotic average consensus in a directed graph (digraph) can be adapted so that the nodes can determine, in a distributed manner, a stopping criterion that allows them to terminate ...

    • Article  

      Distributed stopping for average consensus in undirected graphs via event-triggered strategies 

      Manitara, N. E.; Hadjicostis, Christoforos N. (2016)
      We develop and analyze two distributed event-triggered linear iterative algorithms that enable the components of a distributed system, each with some initial value, to reach approximate average consensus on their initial ...

    • Conference Object  

      Distributed stopping for average consensus using double linear iterative strategies 

      Manitara, N. E.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2014)
      We consider how double linear iterative strategies for asymptotic average consensus can be adapted so that the nodes can determine, in a distributed fashion, a stopping criterion that allows them to terminate (in finite ...

    • Conference Object  

      Information dissemination in networks via linear iterative strategies over finite fields 

      Sundaram, S.; Hadjicostis, Christoforos N. (2009)
      Given an arbitrary network of interconnected nodes, each with an initial value from a discrete set, we consider the problem of distributively disseminating these initial values under the constraint that the nodes can only ...

    • Conference Object  

      Linear iterative strategies for transmitting streams of values through sensor networks 

      Sundaram, S.; Hadjicostis, Christoforos N. (2009)
      For any given fixed network of interconnected nodes, with some nodes designated as sources and some nodes designated as sinks, we investigate the problem of transmitting a stream of values from every source node to all of ...

    • Conference Object  

      On the time complexity of information dissemination via linear iterative strategies 

      Sundaram, S.; Hadjicostis, Christoforos N. (2010)
      Given an arbitrary network of interconnected nodes, each with an initial value, we study the number of time-steps required for some (or all) of the nodes to gather all of the initial values via a linear iterative strategy. ...

      Browse

      EverywhereCommunities & CollectionsBy Submission DateAuthorsTitlesSubjectsBy TypeBy DepartmentBy Faculty

      My Account

      Login
      Πνευματικά δικαιώματα ©  Βιβλιοθήκη Πανεπιστημίου Κύπρου
      Contact Us | Send Feedback
      Οδηγίες κατάθεσης διδακτορικής διατριβής
      Open Access
      ORCiD