Mudanças entre as edições de "Sobre DTNS"
Ir para navegação
Ir para pesquisar
| Linha 25: | Linha 25: | ||
[http://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=8&ved=0CHgQFjAH&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.77.9024%26rep%3Drep1%26type%3Dpdf&ei=b0D3T_epCaGo6wHMgKnuBg&usg=AFQjCNF4TBhwlQl7IiRaSJUnyzLy5sN2pQ&sig2=JwiZLQmpJq6KX-VPvRo0Wg COMPLEXITY ANALYSIS AND OPTIMAL ALGORITHMS FOR DECENTRALIZED DECISION MAKING] | [http://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=8&ved=0CHgQFjAH&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.77.9024%26rep%3Drep1%26type%3Dpdf&ei=b0D3T_epCaGo6wHMgKnuBg&usg=AFQjCNF4TBhwlQl7IiRaSJUnyzLy5sN2pQ&sig2=JwiZLQmpJq6KX-VPvRo0Wg COMPLEXITY ANALYSIS AND OPTIMAL ALGORITHMS FOR DECENTRALIZED DECISION MAKING] | ||
| − | [http://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=5&ved=0CGEQFjAE&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.74.6134%26rep%3Drep1%26type%3Dpdf&ei=3kP3T-n7BaOu6AGovon8Bg&usg=AFQjCNHw8N0fmmLG4iiswB6WCd2TaqmhJg&sig2=FzNScMWE3i5fKTKy09AgpQ] | + | [http://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=5&ved=0CGEQFjAE&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.74.6134%26rep%3Drep1%26type%3Dpdf&ei=3kP3T-n7BaOu6AGovon8Bg&usg=AFQjCNHw8N0fmmLG4iiswB6WCd2TaqmhJg&sig2=FzNScMWE3i5fKTKy09AgpQ Dynamic shortest path in stochastic dynamic networks: Ship routing problem] |
Edição das 19h27min de 9 de julho de 2012
Formalização de DTNs
Opções de Solução do Problema
Dynamic flows with time-varying network parameters
COMPLEXITY ANALYSIS AND OPTIMAL ALGORITHMS FOR DECENTRALIZED DECISION MAKING
Dynamic shortest path in stochastic dynamic networks: Ship routing problem