The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R a D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available.Subprocedure Total-Cost computes the transformations in the path from Rc to r, summing their costs to get the total path cost. Algorithm 1. Compute ... ForallrG^ cdoA(vr)^0 2. For all r Ap R \ Rc do A(vr) alt;- oc 3. ... S alt;- l)a#39;i=1S(vn) u {r} 3. tc alt;- Ef, . esc(fa#39;) 4. return pair(tc, S) Theorem 5. ... 6 Related Work and Conclusions This work is somewhat reminiscent of previous work on multi-agent supply chains. Althoughanbsp;...

Title | : | Mathematical Foundations of Computer Science 2010 |

Author | : | Petr Hlineny |

Publisher | : | Springer Science & Business Media - 2010-08-10 |

Continue