Michail-Antisthenis I. Tsompanas

Learn More
Man-made transport networks and their design are closely related to the shortest path problem and considered amongst the most debated problems of computational intelligence. Apart from using conventional or bio-inspired computer algorithms, many researchers tried to solve this kind of problem using biological computing substrates, gas-discharge solvers,(More)
Over the last few years, an increasing number of publications has shown that living organisms are very effective in finding solutions to complex mathematical problems which usually demand large computation resources. The plasmodium of the slime mould Physarum polycephalum is a successful example that has been used to solve path-finding problems on graphs(More)
A network design problem is to select a subset of links in a transport network that satisfy passengers or cargo transportation demands while minimizing the overall costs of the transportation. We propose a mathematical model of the foraging behaviour of slime mould P. polycephalum to solve the network design problem and construct optimal transport networks.(More)
Physarum polycephalum has repeatedly, during the last decade, demonstrated that has unexpected computing abilities. While the plasmodium of P. polycephalum can effectively solve several geographical described problems, like evaluating human–made transport networks, a disadvantage of a biological computer, like the aforementioned is directly apparent; the(More)
Nowadays, there is an increasingly recognized need for more computing power, which has led to multicore processors. However, this evolution is still restrained by the poor efficiency of memory chips. As a possible solution to the problem, this paper examines a model of re-distributing the memory resources assigned to the processor, especially the on-chip(More)
The Microbial Fuel Cell (MFC) is a bio-electrochemical transducer converting waste products into electricity using microbial communities. Cellular Automaton (CA) is a uniform array of finite-state machines that update their states in discrete time depending on states of their closest neighbors by the same rule. Arrays of MFCs could, in principle, act as(More)
Recent computing architectures are implemented by shared memory technologies to alleviate the high latency experienced by off-chip memory transfers, but the high architectural complexity of modern multicore processors has presented many questions. To tackle the design of efficient algorithms scheduling workloads over available cores, this article presents a(More)
—Biological systems that have been subjected to vast time periods of evolution, have provided numerous times inspiration for problem solving techniques. These systems have evolved to survive in harsh environments, thus they provide more efficient solutions than the conventional methods. The inspiration of this study was based on the computing abilities that(More)
A main problem in multi-core architectures is the runtime management and the allocation of shared resources, such as the shared memory. This paper presents a model of the memory resources allocation, in specific the on-chip shared memory, in order to achieve higher performance based on the basic concepts of game theory and the iterated spatial prisoner's(More)