COCOON
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
COCOON
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. Problems of secure communication and computation have been studied extensively in network models, for example, Franklin and Yung have studied secure communications in the...
COCOON
2005
Springer
14 years 7 months ago
2005
Springer