Browsing by Subject "Graph theory"
Now showing items 2140 of 78

Article
Efficient gossip and robust distributed computation
(2005)This paper presents an efficient deterministic gossip algorithm for p synchronous, crashprone, messagepassing processors. The algorithm has time complexity T=O(log2p) and message complexity M=O(p1+ε), for any ε>0. This ...

Conference Object
Exploring Price Classification in Day Ahead Electricity Markets through Graph Theory and PNN Modelling
(2023)This paper delves into the intersection of graph theory and electricity market data analysis. The introductory section lays the foundation by elucidating the theoretical underpinnings of graph theory and its relevance to ...

Article
Extended semantics and optimization algorithms for CPnetworks
(2004)Preference elicitation is a serious bottleneck in many decision support applications and agent specification tasks. Ceteris paribus (CP)nets were designed to make the process of preference elicitation simpler and more ...

Article
Extension and application of an algorithm for systematic identification of weak coupling and partitions in dynamic system models
(2009)This paper reviews and extends a technique to detect weak coupling (oneway coupling or complete decoupling) among elements of a dynamic system model, and to partition and reduce models in which weak coupling is found. The ...

Article
Fault diagnosis in discrete event systems modeled by partially observed petri nets
(2009)In this paper, we study fault diagnosis in discrete event systems modeled by partially observed Petri nets, i.e., Petri nets equipped with sensors that allow observation of the number of tokens in some of the places and/or ...

Conference Object
Fault diagnosis in discrete event systems modeled by petri nets with outputs
(2008)In this paper, we study fault diagnosis in discrete event systems modeled by Petri nets with outputs, i.e., Petri nets with place sensors and transition sensors. Faults are modeled as unobservable transitions and are divided ...

Conference Object
Fault model identification with petri nets
(2008)Most of the fault identification problems in the Discrete Event Systems literature assume knowledge of the structure of the net system, including the nature (and behavior) of the possible faults. In this paper we deal with ...

Conference Object
Faulttolerant supervisory control of discrete event systems modeled by bounded Petri nets
(2007)This paper considers bounded Petri nets with both controllable and uncontrollable transitions, and addresses the synthesis of a faulttolerant supervisor in a setting where the control specifications are described via ...

Article
Finite segment model complexity of an EulerBernoulli beam
(2015)A common approach for modeling the dynamic behavior of distributed parameter systems is the approximation through finitesegment models. These models are able to accurately predict the dynamic behavior of the system given ...

Conference Object
Genetic algorithms for shortest path routing of autonomous gliders
(2008)Onboard power resources pose inevitable limitations on the flight performance of any aerial vehicle regardless of its type, size or mission. Popular soaring techniques recognized to be providing significant energy savings ...

Doctoral Thesis Open Access
Graph design using knowledgedriven, selfadaptive multiobjective evolutionary graph algorithms
(Πανεπιστήμιο Κύπρου, Σχολή Θετικών και Εφαρμοσμένων Επιστημών / University of Cyprus, Faculty of Pure and Applied Sciences, 201006)Επιπλέον, αξιοποιούμε τις προτεινόμενες μεθόδους για την επίλυση ενός πρακτικού ζητήματος. Συγκεκριμένα, αναπτύσσουμε ένα σύστημα το οποίο προσφέρει αξιόπιστες συστάσεις (recommendations) σε ευρωπαϊκούς οργανισμούς για ...

Article
Graph theoretical structures in logic programs and default theories
(1996)In this paper we present a graph representation of logic programs and default theories. We show that many of the semantics proposed for logic programs with negation can be expressed in terms of notions emerging from graph ...

Article
A graphtheoretic network security game
(2005)Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. We model this practical network scenario as a noncooperative multiplayer game on ...

Article
A graphtheoretic network security game
(2008)Consider a network vulnerable to viral infection, where the security software can guarantee safety only to a limited part of it. We model this practical network scenario as a noncooperative multiplayer game on a graph, ...

Article
Graphical inference for multiple intrusion detection
(2008)In this paper, we consider vulnerabilities of networked systems and develop a multiple intrusion detection system (MIDS) which operates by running belief propagation on an appropriately constructed weighted bipartite graph. ...

Conference Object
How fast are the twodimensional gaussian waves?
(2002)For a stationary twodimensional random field evolving in time, we derive the intensity distributions of appropriately defined velocities of crossing contours. The results are based on a generalization of the Rice formula. ...

Article
How many attackers can selfish defenders catch?
(2013)In a distributed system with attacks and defenses, both attackers and defenders are selfinterested entities. We assume a rewardsharing scheme among interdependent defenders

Article
Ideal physical element representation from reduced bond graphs
(2002)Previous research has demonstrated that bond graphs are a natural and convenient representation to implement energybased metrics that evaluate the relative 'value' of energy elements in a dynamic system model. Bond graphs ...

Article
The impact of network structure on the stability of greedy protocols
(2003)A packetswitching network is stable if the number of packets in the network remains bounded at all times. A very natural question that arises in the context of stability and instability properties of such networks is how ...

Article
The impact of network structure on the stability of greedy protocols
(2005)Some examples of the impact network structure has on stability behavior of greedy protocols and networks were presented. An important problem was to study the impact of network structure parameters on other greedy protocols. ...