This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Distributed computing systems are continuously increasing in complexity and cost of managing, and system management tasks require significantly higher levels of autonomic managemen...
Model-driven development requires a full set of development tools. While technologies for constructing graphical editors, compilers etc. are readily available, there is a lack of ...
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal verication problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...