Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
Abstract. In this paper, we present and analyze a framework for selfevolving autonomic services in a wireless nomadic environment. We present a disconnected network architecture, w...
Iacopo Carreras, Francesco De Pellegrini, Daniele ...
Truly autonomic networks ultimately require self-modifying, evolving protocol software. Otherwise humans must intervene in every situation that has not been anticipated at design t...
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
Nash equilibria and dominant strategies are two of the major approaches to deal with selfishness in an automated system (AS), where each agent is a selfish entity. In this paper,...