Filtros : "Inglês" "2013" "IME-MAC" Limpar

Filtros



Refine with date range


  • Source: Information. Unidade: IME

    Assunto: LÓGICA MATEMÁTICA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FINGER, Marcelo e REIS, Poliana Magalhães. On the predictability of classical propositional logic. Information, v. 4, n. 1, p. 60-74, 2013Tradução . . Disponível em: https://doi.org/10.3390/info4010060. Acesso em: 04 out. 2024.
    • APA

      Finger, M., & Reis, P. M. (2013). On the predictability of classical propositional logic. Information, 4( 1), 60-74. doi:10.3390/info4010060
    • NLM

      Finger M, Reis PM. On the predictability of classical propositional logic [Internet]. Information. 2013 ; 4( 1): 60-74.[citado 2024 out. 04 ] Available from: https://doi.org/10.3390/info4010060
    • Vancouver

      Finger M, Reis PM. On the predictability of classical propositional logic [Internet]. Information. 2013 ; 4( 1): 60-74.[citado 2024 out. 04 ] Available from: https://doi.org/10.3390/info4010060
  • Source: Artificial Intelligence. Unidades: IME, EACH

    Assunto: INTELIGÊNCIA ARTIFICIAL

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      RIBEIRO, Márcio Moretto et al. Minimal change: Relevance and recovery revisited. Artificial Intelligence, v. 201, p. 59-80, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.artint.2013.06.001. Acesso em: 04 out. 2024.
    • APA

      Ribeiro, M. M., Wassermann, R., Flouris, G., & Antoniou, G. (2013). Minimal change: Relevance and recovery revisited. Artificial Intelligence, 201, 59-80. doi:10.1016/j.artint.2013.06.001
    • NLM

      Ribeiro MM, Wassermann R, Flouris G, Antoniou G. Minimal change: Relevance and recovery revisited [Internet]. Artificial Intelligence. 2013 ; 201 59-80.[citado 2024 out. 04 ] Available from: https://doi.org/10.1016/j.artint.2013.06.001
    • Vancouver

      Ribeiro MM, Wassermann R, Flouris G, Antoniou G. Minimal change: Relevance and recovery revisited [Internet]. Artificial Intelligence. 2013 ; 201 59-80.[citado 2024 out. 04 ] Available from: https://doi.org/10.1016/j.artint.2013.06.001
  • Source: International Transactions in Operational Research. Unidade: IME

    Assunto: PROGRAMAÇÃO MATEMÁTICA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg et al. Packing circles within ellipses. International Transactions in Operational Research, v. 20, n. 3, p. 365-389, 2013Tradução . . Disponível em: https://doi.org/10.1111/itor.12006. Acesso em: 04 out. 2024.
    • APA

      Birgin, E. J. G., Bustamante, L. H., Callisaya, H. F., & Martinez, J. M. (2013). Packing circles within ellipses. International Transactions in Operational Research, 20( 3), 365-389. doi:10.1111/itor.12006
    • NLM

      Birgin EJG, Bustamante LH, Callisaya HF, Martinez JM. Packing circles within ellipses [Internet]. International Transactions in Operational Research. 2013 ; 20( 3): 365-389.[citado 2024 out. 04 ] Available from: https://doi.org/10.1111/itor.12006
    • Vancouver

      Birgin EJG, Bustamante LH, Callisaya HF, Martinez JM. Packing circles within ellipses [Internet]. International Transactions in Operational Research. 2013 ; 20( 3): 365-389.[citado 2024 out. 04 ] Available from: https://doi.org/10.1111/itor.12006
  • Source: Knowledge Based Systems. Unidade: IME

    Assunto: INTELIGÊNCIA ARTIFICIAL

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SILVA, Flávio Soares Corrêa da et al. Interaction protocols for cross-organisational workflows. Knowledge Based Systems, v. 37, p. 121-136, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.knosys.2012.07.023. Acesso em: 04 out. 2024.
    • APA

      Silva, F. S. C. da, Fernandez Venero, M. L., David, D. M., Saleem, M., & Chung, P. W. H. (2013). Interaction protocols for cross-organisational workflows. Knowledge Based Systems, 37, 121-136. doi:10.1016/j.knosys.2012.07.023
    • NLM

      Silva FSC da, Fernandez Venero ML, David DM, Saleem M, Chung PWH. Interaction protocols for cross-organisational workflows [Internet]. Knowledge Based Systems. 2013 ; 37 121-136.[citado 2024 out. 04 ] Available from: https://doi.org/10.1016/j.knosys.2012.07.023
    • Vancouver

      Silva FSC da, Fernandez Venero ML, David DM, Saleem M, Chung PWH. Interaction protocols for cross-organisational workflows [Internet]. Knowledge Based Systems. 2013 ; 37 121-136.[citado 2024 out. 04 ] Available from: https://doi.org/10.1016/j.knosys.2012.07.023
  • Source: Proceedings. Conference titles: Hawaii International Conference on System Sciences - HICSS. Unidade: IME

    Subjects: MÉTODOS ÁGEIS, ENGENHARIA DE SOFTWARE

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SANTOS, Viviane Almeida dos e GOLDMAN, Alfredo e RORIZ FILHO, Heitor. The influence of practices adopted by agile coaching and training to foster interaction and knowledge sharing in organizational practices. 2013, Anais.. Piscataway: IEEE, 2013. Disponível em: https://doi.org/10.1109/HICSS.2013.528. Acesso em: 04 out. 2024.
    • APA

      Santos, V. A. dos, Goldman, A., & Roriz Filho, H. (2013). The influence of practices adopted by agile coaching and training to foster interaction and knowledge sharing in organizational practices. In Proceedings. Piscataway: IEEE. doi:10.1109/HICSS.2013.528
    • NLM

      Santos VA dos, Goldman A, Roriz Filho H. The influence of practices adopted by agile coaching and training to foster interaction and knowledge sharing in organizational practices [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1109/HICSS.2013.528
    • Vancouver

      Santos VA dos, Goldman A, Roriz Filho H. The influence of practices adopted by agile coaching and training to foster interaction and knowledge sharing in organizational practices [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1109/HICSS.2013.528
  • Source: Journal of Chemical Theory and Computation. Unidade: IME

    Subjects: QUÍMICA TEÓRICA, OTIMIZAÇÃO COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BIRGIN, Ernesto Julian Goldberg et al. Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations. Journal of Chemical Theory and Computation, v. 9, n. 2, p. 1043-1051, 2013Tradução . . Disponível em: https://doi.org/10.1021/ct3009683. Acesso em: 04 out. 2024.
    • APA

      Birgin, E. J. G., Martinez, J. M., Martínez, L., & Rocha, G. B. (2013). Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations. Journal of Chemical Theory and Computation, 9( 2), 1043-1051. doi:10.1021/ct3009683
    • NLM

      Birgin EJG, Martinez JM, Martínez L, Rocha GB. Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations [Internet]. Journal of Chemical Theory and Computation. 2013 ; 9( 2): 1043-1051.[citado 2024 out. 04 ] Available from: https://doi.org/10.1021/ct3009683
    • Vancouver

      Birgin EJG, Martinez JM, Martínez L, Rocha GB. Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations [Internet]. Journal of Chemical Theory and Computation. 2013 ; 9( 2): 1043-1051.[citado 2024 out. 04 ] Available from: https://doi.org/10.1021/ct3009683
  • Source: Information and Software Technology. Unidade: IME

    Assunto: DESENVOLVIMENTO DE SOFTWARE

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MELO, Claudia de Oliveira et al. Interpretative case studies on agile team productivity and management. Information and Software Technology, v. 55, n. 2, p. 412-427, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.infsof.2012.09.004. Acesso em: 04 out. 2024.
    • APA

      Melo, C. de O., Cruzes, D. S., Kon, F., & Conradi, R. (2013). Interpretative case studies on agile team productivity and management. Information and Software Technology, 55( 2), 412-427. doi:10.1016/j.infsof.2012.09.004
    • NLM

      Melo C de O, Cruzes DS, Kon F, Conradi R. Interpretative case studies on agile team productivity and management [Internet]. Information and Software Technology. 2013 ; 55( 2): 412-427.[citado 2024 out. 04 ] Available from: https://doi.org/10.1016/j.infsof.2012.09.004
    • Vancouver

      Melo C de O, Cruzes DS, Kon F, Conradi R. Interpretative case studies on agile team productivity and management [Internet]. Information and Software Technology. 2013 ; 55( 2): 412-427.[citado 2024 out. 04 ] Available from: https://doi.org/10.1016/j.infsof.2012.09.004
  • Source: Service Oriented Computing and Applications (SOCA). Unidade: IME

    Assunto: PROGRAMAÇÃO ORIENTADA A OBJETOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LEITE, Leonardo Alexandre Ferreira et al. A systematic literature review of service choreography adaptation. Service Oriented Computing and Applications (SOCA), v. 7, n. 3, p. 199-216, 2013Tradução . . Disponível em: https://doi.org/10.1007/s11761-012-0125-z. Acesso em: 04 out. 2024.
    • APA

      Leite, L. A. F., Oliva, G. A., Nogueira, G. M., Gerosa, M. A., Kon, F., & Milojicic, D. S. (2013). A systematic literature review of service choreography adaptation. Service Oriented Computing and Applications (SOCA), 7( 3), 199-216. doi:10.1007/s11761-012-0125-z
    • NLM

      Leite LAF, Oliva GA, Nogueira GM, Gerosa MA, Kon F, Milojicic DS. A systematic literature review of service choreography adaptation [Internet]. Service Oriented Computing and Applications (SOCA). 2013 ; 7( 3): 199-216.[citado 2024 out. 04 ] Available from: https://doi.org/10.1007/s11761-012-0125-z
    • Vancouver

      Leite LAF, Oliva GA, Nogueira GM, Gerosa MA, Kon F, Milojicic DS. A systematic literature review of service choreography adaptation [Internet]. Service Oriented Computing and Applications (SOCA). 2013 ; 7( 3): 199-216.[citado 2024 out. 04 ] Available from: https://doi.org/10.1007/s11761-012-0125-z
  • Source: Proceedings. Conference titles: International Parallel and Distributed Processing Symposium Workshops and PhD Forum - IPDPSW. Unidade: IME

    Subjects: ALGORITMOS DE SCHEDULING, COMPUTABILIDADE E COMPLEXIDADE

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      GOLDMAN, Alfredo et al. Combining parallel algorithms solving the same application: what is the best approach? 2013, Anais.. Piscataway: IEEE, 2013. Disponível em: https://doi.org/10.1109/IPDPSW.2013.81. Acesso em: 04 out. 2024.
    • APA

      Goldman, A., Lepping, J., Ngoko, Y., & Trystram, D. (2013). Combining parallel algorithms solving the same application: what is the best approach? In Proceedings. Piscataway: IEEE. doi:10.1109/IPDPSW.2013.81
    • NLM

      Goldman A, Lepping J, Ngoko Y, Trystram D. Combining parallel algorithms solving the same application: what is the best approach? [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1109/IPDPSW.2013.81
    • Vancouver

      Goldman A, Lepping J, Ngoko Y, Trystram D. Combining parallel algorithms solving the same application: what is the best approach? [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1109/IPDPSW.2013.81
  • Source: Proceedings. Conference titles: ACM SIGPLAN workshop on Erlang. Unidade: IME

    Subjects: METODOLOGIA E TÉCNICAS DE COMPUTAÇÃO, ENGENHARIA DE SOFTWARE

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      FRANCESQUINI, Emilio e GOLDMAN, Alfredo e MEHAUT, Jean-François. Actor scheduling for multicore hierarchical memory platforms. 2013, Anais.. New York: ACM, 2013. Disponível em: https://doi.org/10.1145/2505305.2505313. Acesso em: 04 out. 2024.
    • APA

      Francesquini, E., Goldman, A., & Mehaut, J. -F. (2013). Actor scheduling for multicore hierarchical memory platforms. In Proceedings. New York: ACM. doi:10.1145/2505305.2505313
    • NLM

      Francesquini E, Goldman A, Mehaut J-F. Actor scheduling for multicore hierarchical memory platforms [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1145/2505305.2505313
    • Vancouver

      Francesquini E, Goldman A, Mehaut J-F. Actor scheduling for multicore hierarchical memory platforms [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1145/2505305.2505313
  • Source: Information theory, combinatorics, and search theory: in memory of Rudolf Ahlswede. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      HOPPEN, Carlos e KOHAYAKAWA, Yoshiharu e LEFMANN, Hanno. An unstable hypergraph problem with a unique optimal solution. Information theory, combinatorics, and search theory: in memory of Rudolf Ahlswede. Tradução . Berlin: Springer, 2013. . Disponível em: https://doi.org/10.1007/978-3-642-36899-8_20. Acesso em: 04 out. 2024.
    • APA

      Hoppen, C., Kohayakawa, Y., & Lefmann, H. (2013). An unstable hypergraph problem with a unique optimal solution. In Information theory, combinatorics, and search theory: in memory of Rudolf Ahlswede. Berlin: Springer. doi:10.1007/978-3-642-36899-8_20
    • NLM

      Hoppen C, Kohayakawa Y, Lefmann H. An unstable hypergraph problem with a unique optimal solution [Internet]. In: Information theory, combinatorics, and search theory: in memory of Rudolf Ahlswede. Berlin: Springer; 2013. [citado 2024 out. 04 ] Available from: https://doi.org/10.1007/978-3-642-36899-8_20
    • Vancouver

      Hoppen C, Kohayakawa Y, Lefmann H. An unstable hypergraph problem with a unique optimal solution [Internet]. In: Information theory, combinatorics, and search theory: in memory of Rudolf Ahlswede. Berlin: Springer; 2013. [citado 2024 out. 04 ] Available from: https://doi.org/10.1007/978-3-642-36899-8_20
  • Source: Proceedings. Conference titles: International Conference on Computer Analysis of Images and Patterns - CAIP. Unidade: IME

    Assunto: PROCESSAMENTO DE IMAGENS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MANSILLA, Lucy Alsina Choque e MIRANDA, Paulo André Vechiatto de. Image segmentation by oriented image foresting transform with geodesic star convexity. 2013, Anais.. Berlin: Springer, 2013. Disponível em: https://doi.org/10.1007/978-3-642-40261-6_69. Acesso em: 04 out. 2024.
    • APA

      Mansilla, L. A. C., & Miranda, P. A. V. de. (2013). Image segmentation by oriented image foresting transform with geodesic star convexity. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-40261-6_69
    • NLM

      Mansilla LAC, Miranda PAV de. Image segmentation by oriented image foresting transform with geodesic star convexity [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1007/978-3-642-40261-6_69
    • Vancouver

      Mansilla LAC, Miranda PAV de. Image segmentation by oriented image foresting transform with geodesic star convexity [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1007/978-3-642-40261-6_69
  • Source: Proceedings. Conference titles: International Conference on Acoustics, Speech, and Signal Processing - ICASSP. Unidade: IME

    Subjects: PROCESSOS GAUSSIANOS, INFERÊNCIA PARAMÉTRICA, SÍNTESE DE FALA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MACHADO, Anderson Fraiha e BONAFONTE, Antonio e QUEIROZ, Marcelo Gomes de. Parametric decomposition of the spectral envelope. 2013, Anais.. Piscataway: IEEE, 2013. Disponível em: https://doi.org/10.1109/ICASSP.2013.6637712. Acesso em: 04 out. 2024.
    • APA

      Machado, A. F., Bonafonte, A., & Queiroz, M. G. de. (2013). Parametric decomposition of the spectral envelope. In Proceedings. Piscataway: IEEE. doi:10.1109/ICASSP.2013.6637712
    • NLM

      Machado AF, Bonafonte A, Queiroz MG de. Parametric decomposition of the spectral envelope [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1109/ICASSP.2013.6637712
    • Vancouver

      Machado AF, Bonafonte A, Queiroz MG de. Parametric decomposition of the spectral envelope [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1109/ICASSP.2013.6637712
  • Source: Proceedings. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: IME

    Subjects: RACIOCÍNIO PROBABILÍSTICO, PROCESSOS DE MARKOV, PROCESSOS ESTOCÁSTICOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      SANTOS, Felipe Martins dos e BARROS, Leliane Nunes de e GAMARRA HOLGUIN, Mijail. Stochastic bisimulation for MDPs using reachability analysis. 2013, Anais.. Piscataway: IEEE, 2013. Disponível em: https://doi.org/10.1109/BRACIS.2013.43. Acesso em: 04 out. 2024.
    • APA

      Santos, F. M. dos, Barros, L. N. de, & Gamarra Holguin, M. (2013). Stochastic bisimulation for MDPs using reachability analysis. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2013.43
    • NLM

      Santos FM dos, Barros LN de, Gamarra Holguin M. Stochastic bisimulation for MDPs using reachability analysis [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1109/BRACIS.2013.43
    • Vancouver

      Santos FM dos, Barros LN de, Gamarra Holguin M. Stochastic bisimulation for MDPs using reachability analysis [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1109/BRACIS.2013.43
  • Source: Mathematical morphology and its applications to signal and image processing: proceedings. Conference titles: International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing -ISMM. Unidade: IME

    Subjects: OTIMIZAÇÃO COMBINATÓRIA, MATEMÁTICA DA COMPUTAÇÃO

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      REIS, Marcelo da Silva e BARRERA, Júnior. Solving problems in mathematical morphology through reductions to the U-Curve problem. 2013, Anais.. Berlin: Springer, 2013. Disponível em: https://doi.org/10.1007/978-3-642-38294-9_5. Acesso em: 04 out. 2024.
    • APA

      Reis, M. da S., & Barrera, J. (2013). Solving problems in mathematical morphology through reductions to the U-Curve problem. In Mathematical morphology and its applications to signal and image processing: proceedings. Berlin: Springer. doi:10.1007/978-3-642-38294-9_5
    • NLM

      Reis M da S, Barrera J. Solving problems in mathematical morphology through reductions to the U-Curve problem [Internet]. Mathematical morphology and its applications to signal and image processing: proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1007/978-3-642-38294-9_5
    • Vancouver

      Reis M da S, Barrera J. Solving problems in mathematical morphology through reductions to the U-Curve problem [Internet]. Mathematical morphology and its applications to signal and image processing: proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1007/978-3-642-38294-9_5
  • Source: Proceedings of SPIE. Conference titles: Medical Imaging : Computer-Aided Diagnosis. Unidade: IME

    Subjects: DIAGNÓSTICO POR COMPUTADOR, ANGIOGRAFIA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MACEDO, Maysa Malfiza Garcia et al. A centerline-based estimator of vessel bifurcations in angiography images. Proceedings of SPIE. Belingham: SPIE. Disponível em: https://doi.org/10.1117/12.2007812. Acesso em: 04 out. 2024. , 2013
    • APA

      Macedo, M. M. G., Galarreta Valverde, M. Á., Mekkaoui, C., & Jackowski, M. P. (2013). A centerline-based estimator of vessel bifurcations in angiography images. Proceedings of SPIE. Belingham: SPIE. doi:10.1117/12.2007812
    • NLM

      Macedo MMG, Galarreta Valverde MÁ, Mekkaoui C, Jackowski MP. A centerline-based estimator of vessel bifurcations in angiography images [Internet]. Proceedings of SPIE. 2013 ; 8670 86703K-1-86703K-7.[citado 2024 out. 04 ] Available from: https://doi.org/10.1117/12.2007812
    • Vancouver

      Macedo MMG, Galarreta Valverde MÁ, Mekkaoui C, Jackowski MP. A centerline-based estimator of vessel bifurcations in angiography images [Internet]. Proceedings of SPIE. 2013 ; 8670 86703K-1-86703K-7.[citado 2024 out. 04 ] Available from: https://doi.org/10.1117/12.2007812
  • Source: Proceedings. Conference titles: International Symposium on Network Computing and Applications - NCA. Unidade: IME

    Subjects: PROGRAMAÇÃO LINEAR, REDE DE TELECOMUNICAÇÕES

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      AMANTEA, Guilherme e RIVANO, Herve e GOLDMAN, Alfredo. A delay-tolerant network routing algorithm based on column generation. 2013, Anais.. Piscataway: IEEE, 2013. Disponível em: https://doi.org/10.1109/NCA.2013.34. Acesso em: 04 out. 2024.
    • APA

      Amantea, G., Rivano, H., & Goldman, A. (2013). A delay-tolerant network routing algorithm based on column generation. In Proceedings. Piscataway: IEEE. doi:10.1109/NCA.2013.34
    • NLM

      Amantea G, Rivano H, Goldman A. A delay-tolerant network routing algorithm based on column generation [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1109/NCA.2013.34
    • Vancouver

      Amantea G, Rivano H, Goldman A. A delay-tolerant network routing algorithm based on column generation [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1109/NCA.2013.34
  • Source: Proceedings. Conference titles: Conference on Uncertainty in Artificial Intelligence - UAI. Unidade: IME

    Subjects: CONTROLE (TEORIA DE SISTEMAS E CONTROLE), PROCESSOS DE MARKOV

    Versão PublicadaAcesso à fonteHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      VIANNA, Luis Gustavo Rocha e SANNER, Scott e BARROS, Leliane Nunes de. Bounded approximate symbolic dynamic programming for hybrid MDPs. 2013, Anais.. Corvallis: AUAI Press, 2013. Disponível em: https://www.auai.org/uai2013/prints/proceedings.pdf. Acesso em: 04 out. 2024.
    • APA

      Vianna, L. G. R., Sanner, S., & Barros, L. N. de. (2013). Bounded approximate symbolic dynamic programming for hybrid MDPs. In Proceedings. Corvallis: AUAI Press. Recuperado de https://www.auai.org/uai2013/prints/proceedings.pdf
    • NLM

      Vianna LGR, Sanner S, Barros LN de. Bounded approximate symbolic dynamic programming for hybrid MDPs [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://www.auai.org/uai2013/prints/proceedings.pdf
    • Vancouver

      Vianna LGR, Sanner S, Barros LN de. Bounded approximate symbolic dynamic programming for hybrid MDPs [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://www.auai.org/uai2013/prints/proceedings.pdf
  • Source: Proceedings. Conference titles: International Conference on e-Science. Unidade: IME

    Subjects: VISÃO COMPUTACIONAL, RECONHECIMENTO DE PADRÕES, TEORIA DOS GRAFOS

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      LEANDRO, Jorge de Jesus Gomes e CÉSAR JÚNIOR, Roberto Marcondes e FERIS, Rogério Schmidt. Shape analysis using the spectral graph wavelet transform. 2013, Anais.. Piscataway: IEEE, 2013. Disponível em: https://doi.org/10.1109/eScience.2013.45. Acesso em: 04 out. 2024.
    • APA

      Leandro, J. de J. G., César Júnior, R. M., & Feris, R. S. (2013). Shape analysis using the spectral graph wavelet transform. In Proceedings. Piscataway: IEEE. doi:10.1109/eScience.2013.45
    • NLM

      Leandro J de JG, César Júnior RM, Feris RS. Shape analysis using the spectral graph wavelet transform [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1109/eScience.2013.45
    • Vancouver

      Leandro J de JG, César Júnior RM, Feris RS. Shape analysis using the spectral graph wavelet transform [Internet]. Proceedings. 2013 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1109/eScience.2013.45
  • Source: Facets of combinatorial optimization. Unidade: IME

    Subjects: ALGORITMOS DE APROXIMAÇÃO, ALGORITMOS DE SCHEDULING, PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      BARBOSA, Rafael da Ponte e WAKABAYASHI, Yoshiko. Algorithms for scheduling sensors to maximize coverage time. Facets of combinatorial optimization. Tradução . Berlin: Springer, 2013. . Disponível em: https://doi.org/10.1007/978-3-642-38189-8_9. Acesso em: 04 out. 2024.
    • APA

      Barbosa, R. da P., & Wakabayashi, Y. (2013). Algorithms for scheduling sensors to maximize coverage time. In Facets of combinatorial optimization. Berlin: Springer. doi:10.1007/978-3-642-38189-8_9
    • NLM

      Barbosa R da P, Wakabayashi Y. Algorithms for scheduling sensors to maximize coverage time [Internet]. In: Facets of combinatorial optimization. Berlin: Springer; 2013. [citado 2024 out. 04 ] Available from: https://doi.org/10.1007/978-3-642-38189-8_9
    • Vancouver

      Barbosa R da P, Wakabayashi Y. Algorithms for scheduling sensors to maximize coverage time [Internet]. In: Facets of combinatorial optimization. Berlin: Springer; 2013. [citado 2024 out. 04 ] Available from: https://doi.org/10.1007/978-3-642-38189-8_9

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024