Teresa Martinez dos Santos Gomes


AuthID: R-000-H69

Publicações Confirmadas: 20



1
TÍTULO: Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks
AUTORES: Teresa Gomes ; Luisa Jorge; Paulo Melo ; Rita Girao Silva ; Sergio Mendes;
PUBLICAÇÃO: 2013, FONTE: 9th International Conference on the Design of Reliable Communication Networks (DRCN) in 2013 9TH INTERNATIONAL CONFERENCE ON THE DESIGN OF RELIABLE COMMUNICATION NETWORKS (DRCN)
INDEXADO EM: Scopus WOS
NO MEU: ORCID
2
TÍTULO: Backup Path calculation in diverse routing considering shared risk link groups
AUTORES: Silva, J; Gomes, T ; Simoes, C;
PUBLICAÇÃO: 2012, FONTE: European Safety and Reliability Conference: Advances in Safety, Reliability and Risk Management, ESREL 2011 in Advances in Safety, Reliability and Risk Management - Proceedings of the European Safety and Reliability Conference, ESREL 2011
INDEXADO EM: Scopus
NO MEU: ORCID
3
TÍTULO: Protected bicriteria paths in transport networks
AUTORES: Teresa Gomes ; Lucia Martins ; Jose Silva; Nuno Gomes Ferreira; Jose Craveirinha ; Joao Climaco ; Ricardo Cadime; Catarina Monica;
PUBLICAÇÃO: 2012, FONTE: 4th International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT) in IV INTERNATIONAL CONGRESS ON ULTRA MODERN TELECOMMUNICATIONS AND CONTROL SYSTEMS 2012 (ICUMT)
INDEXADO EM: Scopus WOS CrossRef
NO MEU: ORCID
4
TÍTULO: An heuristic for maximally SRLG-disjoint path pairs calculation
AUTORES: Silva, J; Gomes, T ; Fernandes, L; Simoes, C; Craveirinha, J ;
PUBLICAÇÃO: 2011, FONTE: 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2011 in International Congress on Ultra Modern Telecommunications and Control Systems and Workshops
INDEXADO EM: Scopus
NO MEU: ORCID
5
TÍTULO: Candidate cycles generation for p-cycle calculation considering SRLGs
AUTORES: Ferreira, M; Gomes, T ;
PUBLICAÇÃO: 2011, FONTE: 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2011 in International Congress on Ultra Modern Telecommunications and Control Systems and Workshops
INDEXADO EM: Scopus
NO MEU: ORCID
6
TÍTULO: Failure protected shortest paths in GMPLS networks
AUTORES: Gomes, T ; Silva, J; Craveirinha, J ; Simoes, C;
PUBLICAÇÃO: 2011, FONTE: 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2011 in International Congress on Ultra Modern Telecommunications and Control Systems and Workshops
INDEXADO EM: Scopus
NO MEU: ORCID
7
TÍTULO: An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs  Full Text
AUTORES: Gomes, T ; Craveirinha, J ; Jorge, L ;
PUBLICAÇÃO: 2010, FONTE: JOURNAL OF COMBINATORIAL OPTIMIZATION, VOLUME: 19, NÚMERO: 3
INDEXADO EM: Scopus WOS CrossRef
NO MEU: ORCID
8
TÍTULO: Obtaining a SRLG-disjoint path pair of min-sum cost
AUTORES: Gomes, T ; Fernandes, L;
PUBLICAÇÃO: 2010, FONTE: 2010 International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2010 in 2010 International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2010
INDEXADO EM: Scopus CrossRef: 5
NO MEU: ORCID
9
TÍTULO: A bi-objective model for routing and wavelength assignment in resilient WDM networks
AUTORES: Teresa Gomes ; Jose Craveirinha ; Carlos Simoes; Joao Climaco ;
PUBLICAÇÃO: 2009, FONTE: European Safety and Reliability Conference (ESREL)/17th Annual Meeting of the Society-for-Risk-Analysis-Europe (SRA-Europe) in SAFETY, RELIABILITY AND RISK ANALYSIS: THEORY, METHODS AND APPLICATIONS, VOLS 1-4, VOLUME: 4
INDEXADO EM: Scopus WOS
NO MEU: ORCID
10
TÍTULO: A bicriteria routing model for multi-fibre WDM networks  Full Text
AUTORES: Gomes, T ; Craveirinha, J ; Climaco, J ; Simoes, C;
PUBLICAÇÃO: 2009, FONTE: PHOTONIC NETWORK COMMUNICATIONS, VOLUME: 18, NÚMERO: 3
INDEXADO EM: Scopus WOS CrossRef: 4
NO MEU: ORCID
Página 1 de 2. Total de resultados: 20.

Um espaço para investigadores e suas Instituições

Links Úteis

Ajuda

© 2024 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service