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...
Many challenges remain in the development of tactical planning systems that will enable automated, cooperative replanning of routes and mission assignments for multiple unmanned gr...
Talib S. Hussain, David J. Montana, Gordon Vidaver
Binomial trees have been used extensively for broadcasting in clusters of workstations. In the case of heterogeneous nondedicated clusters and grid environments, the broadcasting o...
Data Grids provide geographically distributed resources for large-scale data-intensive applications that generate large data sets. However, ensuring efficient access to such huge...
Houda Lamehamedi, Zujun Shentu, Boleslaw K. Szyman...
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...