We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
The Web proxy cache placement problem is often formulated as a classical optimization problem: place N proxies within an internetwork so as to minimize the average user response t...