Analyzing end-to-end functional delays on an IMA platform
Abstract The Integrated Modular Avionics (IMA) platform is the latest generation of
embedded architecture, in which functions share both the execution and communication …
embedded architecture, in which functions share both the execution and communication …
[BOOK][B] Leveraging Applications of Formal Methods, Verification, and Validation: 4th International Symposium on Leveraging Applications, ISoLA 2010, Heraklion …
T Margaria, B Steffen - 2010 - books.google.com
The two volume set LNCS 6415 and LNCS 6416 constitutes the refereed proceedings of the
4th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2010 …
4th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2010 …
Two novel evolutionary formulations of the graph coloring problem
We introduce two novel evolutionary formulations of the problem of coloring the nodes of a
graph. The first formulation is based on the relationship that exists between a graph's …
graph. The first formulation is based on the relationship that exists between a graph's …
A novel evolutionary formulation of the maximum independent set problem
VC Barbosa, LCD Campos - Journal of Combinatorial Optimization, 2004 - Springer
We introduce a novel evolutionary formulation of the problem of finding a maximum
independent set of a graph. The new formulation is based on the relationship that exists …
independent set of a graph. The new formulation is based on the relationship that exists …
On reducing the complexity of matrix clocks
Matrix clocks are a generalization of the notion of vector clocks that allows the local
representation of causal precedence to reach into an asynchronous distributed …
representation of causal precedence to reach into an asynchronous distributed …
On the phase transitions of graph coloring and independent sets
VC Barbosa, RG Ferreira - Physica A: Statistical Mechanics and its …, 2004 - Elsevier
We study combinatorial indicators related to the characteristic phase transitions associated
with the optimization problems of coloring the nodes of a graph with the minimum number of …
with the optimization problems of coloring the nodes of a graph with the minimum number of …
A distributed dynamics for webgraph decontamination
In order to increase the visibility of a target pageT, web spammers createhyperlink structures
called web bubbles, or link farms. As countermeasure, special mobile agents, called web …
called web bubbles, or link farms. As countermeasure, special mobile agents, called web …
Scheduling links for heavy traffic on interfering routes in wireless mesh networks
We consider wireless mesh networks and the problem of scheduling the links of a given set
of routes under the assumption of a heavy-traffic pattern. We assume some TDMA protocol …
of routes under the assumption of a heavy-traffic pattern. We assume some TDMA protocol …
A distributed prime sieving algorithm based on Scheduling by Multiple Edge Reversal
In this article, we propose a fully distributed algorithm for finding all primes in a given interval
[2.. n](or (L, R), more generally), based on the SMER-scheduling by multiple edge reversal …
[2.. n](or (L, R), more generally), based on the SMER-scheduling by multiple edge reversal …
Type of service wide area networking
J Lekashman - Proceedings of the 1989 ACM/IEEE Conference on …, 1989 - dl.acm.org
There are a variety of long distance types of circuits that can be used for data
communication. This paper describes an experiment which optimizes the simultaneous use …
communication. This paper describes an experiment which optimizes the simultaneous use …