• 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 "Electric network topology"

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

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

      Comparison of techniques used for mapping parallel algorithms to message-passing multiprocessors 

      Dikaiakos, Marios D.; Steiglitz, Kenneth; Rogers, Anne (IEEE, 1994)
      This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which are representative of ...

    • 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 ...

    • Article  

      Finding the K highest-ranked answers in a distributed network 

      Zeinalipour-Yazdi, Constantinos D.; Vagena, Zografoula; Kalogeraki, Vana; Gunopulos, Dimitrios; Tsotras, Vassilis J.; Vlachos, Michail; Koudas, Nick; Srivastava, D. (2009)
      In this paper, we present an algorithm for finding the k highest-ranked (or Top-k) answers in a distributed network. A Top-K query returns the subset of most relevant answers, in place of all answers, for two reasons: (i) ...

    • Article  

      Functional algorithm simulation of the fast multipole method: Architectural implications 

      Dikaiakos, Marios D. (1996)
      Functional Algorithm Simulation in a methodology for predicting the computation and communication characteristics of parallel algorithms for a class of scientific problems, without actually performing the expensive numerical ...

    • Conference Object  

      Neural networks to estimate the influence of cervix length on the prediction of spontaneous preterm delivery before 37 weeks 

      Neokleous,Kleanthis C.; Schizas, Christos N.; Neokleous,Kleanthis C.; Pattichis, Constantinos S.; Anastasopoulos, Panagiotis; Nikolaides, Kypros H. (2008)
      Neural networks were applied in an effort to predict the risk for early spontaneous preterm delivery using various demographic, clinical, and laboratory inputs. Furthermore, attention has been focused on the influence of ...

    • Article  

      New Zn 2+ metal organic frameworks with unique network topologies from the combination of trimesic acid and amino-alcohols 

      Manos, Manolis J.; Moushi, Eleni E.; Papaefstathìou, Giannis S.; Tasiopoulos, Anastasios J. (2012)
      A series of new Zn 2+-trimesate (btc 3-) metal organic frameworks (MOFs) has been isolated in the presence of various amino-alcohols under solvothermal conditions. Thus, the reaction of ZnCl 2 with trimesic acid (H 3btc) ...

    • Article  

      On network survivability algorithms based on trellis graph transformations 

      Louca, Soulla P.; Pitsillides, Andreas; Samaras, George S. (1999)
      Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network survivability. In this paper, we use graph theoretic ...

    • Article  

      A process calculus for dynamic networks 

      Kouzapas, D.; Philippou, Anna (2011)
      In this paper we propose a process calculus framework for dynamic networks in which the network topology may change as computation proceeds. The proposed calculus allows one to abstract away from neighborhood-discovery ...

    • Conference Object  

      Qualifying explore and exploit for efficient data dissemination in emergency adhoc networks 

      Kolios, Panayiotis; Pitsillides, Andreas; Mokryn, O.; Papadaki, Katerina P. (IEEE Computer Society, 2014)
      The literature of wireless adhoc networks includes a plethora of alternative dissemination strategies that aim for efficient delivery of data traffic from source to destination. Hence, the majority of these strategies ...

    • Conference Object  

      RC-BB switch a high performance switching network for B-ISDN 

      Chen, Hongxu; Lambert, Jim; Pitsillides, Andreas (1995)
      Multistage networks are strong candidates for implementation of ATM switching fabrics in B-ISDN networks. Among a number of proposed multistage networks, the Banyan network with its self-routing property, modular structure ...

    • Conference Object  

      Real-time graph visualization tool for vehicular ad-hoc networks: (VIVAGr: VIsualization tool of VAnet Graphs in real-time) 

      Spanakis, E.; Efstathiades, Christodoulos; Pallis, George C.; Dikaiakos, Marios D. (2011)
      In this work we describe VIVAGr, a graphical-oriented real time visualization tool for vehicular ad-hoc network connectivity graphs. This tool enables the effective synthesis of structural, topological, and dynamic ...

    • Article  

      Universal bufferless packet switching 

      Busch, Costas; Magdon-Ismail, M.; Mavronicolas, Marios (2007)
      A packet-switching algorithm specifies the actions of the nodes in order to deliver packets in the network. A packet-switching algorithm is universal if it applies to any network topology and for any batch communication ...

      Browse

      EverywhereCommunities & CollectionsBy Submission DateAuthorsTitlesSubjectsBy TypeBy DepartmentBy Faculty

      My Account

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