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. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ...
Abstract. This paper continues our systematic study of an RNAediting computational model of Genetic Algorithms (GA). This model is constructed based on several genetic editing char...
Abstract. In this work we have implemented and analyzed the performance of a new real coded steady-state genetic algorithm (SSGA) for the flexible ligand-receptor docking problem....