ICALP
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct co...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
We describe several computational problems on prediction and design of RNA molecules.
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
We investigate the protection of migrating agents against the untrusted sites they traverse. The resulting calculus provides a formal framework to reason about protection policies ...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
ICALP
2003
Springer
13 years 9 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...