264,069 research outputs found
Incremental Network Design with Minimum Spanning Trees
Given an edge-weighted graph and a set , the
incremental network design problem with minimum spanning trees asks for a
sequence of edges minimizing
where is the weight of a minimum spanning tree
for the subgraph and . We prove that this problem can be solved by a greedy
algorithm.Comment: 9 pages, minor revision based on reviewer comment
Using Collective Intelligence to Route Internet Traffic
A COllective INtelligence (COIN) is a set of interacting reinforcement
learning (RL) algorithms designed in an automated fashion so that their
collective behavior optimizes a global utility function. We summarize the
theory of COINs, then present experiments using that theory to design COINs to
control internet traffic routing. These experiments indicate that COINs
outperform all previously investigated RL-based, shortest path routing
algorithms.Comment: 7 page
- β¦