• 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 "Initial values"

  • 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-6 of 6

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

      Distributed calculation of linear functions in noisy networks via linear iterations 

      Sundaram, S.; Hadjicostis, Christoforos N. (2008)
      Given a fixed network where each node has some given initial value, and under the constraint that each node receives noisy transmissions from its immediate neighbors, we provide a distributed scheme for any node to calculate ...

    • 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 strategies for average consensus in directed graphs 

      Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (2011)
      We address the average consensus problem for a distributed system whose components (nodes) can exchange information via interconnections (links) that form an arbitrary, strongly connected but possibly directed, topology ...

    • 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  

      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