ReP USP - Resultado da busca

Trabalho de evento
Dynamic deployment of IIOP-enabled components in the JBoss server (2004)
Reverbel, Francisco Carlos da Rocha ; Burke, Bill; Fleury, Marc
Source: Proceedings. Conference titles: Component Deployment: Second International Working Conference, CD 2004. Unidade: IME
Assunto: LINGUAGEM DE PROGRAMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
REVERBEL, Francisco Carlos da Rocha e BURKE, Bill e FLEURY, Marc. Dynamic deployment of IIOP-enabled components in the JBoss server. 2004, Anais.. Berlin: Springer, 2004. . Acesso em: 12 nov. 2024.
APA
Reverbel, F. C. da R., Burke, B., & Fleury, M. (2004). Dynamic deployment of IIOP-enabled components in the JBoss server. In Proceedings. Berlin: Springer.
NLM
Reverbel FC da R, Burke B, Fleury M. Dynamic deployment of IIOP-enabled components in the JBoss server. Proceedings. 2004 ;[citado 2024 nov. 12 ]
Vancouver
Reverbel FC da R, Burke B, Fleury M. Dynamic deployment of IIOP-enabled components in the JBoss server. Proceedings. 2004 ;[citado 2024 nov. 12 ]
Trabalho de evento
Querying priced information in databases: the conjunctive case: extended abstract (2004)
Laber, Eduardo Sany; Carmo, Renato José da Silva; Kohayakawa, Yoshiharu
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Assunto: TEORIA DA INFORMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LABER, Eduardo Sany e CARMO, Renato José da Silva e KOHAYAKAWA, Yoshiharu. Querying priced information in databases: the conjunctive case: extended abstract. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/978-3-540-24698-5_5. Acesso em: 12 nov. 2024.
APA
Laber, E. S., Carmo, R. J. da S., & Kohayakawa, Y. (2004). Querying priced information in databases: the conjunctive case: extended abstract. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24698-5_5
NLM
Laber ES, Carmo RJ da S, Kohayakawa Y. Querying priced information in databases: the conjunctive case: extended abstract [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/978-3-540-24698-5_5
Vancouver
Laber ES, Carmo RJ da S, Kohayakawa Y. Querying priced information in databases: the conjunctive case: extended abstract [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/978-3-540-24698-5_5
Trabalho de evento
A coarse-grained parallel algorithm for spanning tree and connected components (2004)
Cáceres, Edson Norberto; Dehne, Frank; Mongelli, Henrique ; Song, Siang Wun; Szwarcfiter, Jayme Luiz
Source: Proceedings. Conference titles: European Conference on Parallel Processing - Euro-Par. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CÁCERES, Edson Norberto et al. A coarse-grained parallel algorithm for spanning tree and connected components. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-27866-5_110. Acesso em: 12 nov. 2024.
APA
Cáceres, E. N., Dehne, F., Mongelli, H., Song, S. W., & Szwarcfiter, J. L. (2004). A coarse-grained parallel algorithm for spanning tree and connected components. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-27866-5_110
NLM
Cáceres EN, Dehne F, Mongelli H, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-27866-5_110
Vancouver
Cáceres EN, Dehne F, Mongelli H, Song SW, Szwarcfiter JL. A coarse-grained parallel algorithm for spanning tree and connected components [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-27866-5_110
Trabalho de evento
Paraconsistent sensitivity analysis for Bayesian significance tests (2004)
Stern, Julio Michael
Source: Proceedings. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidade: IME
Subjects: TESTES DE HIPÓTESES, SISTEMAS LÓGICOS NÃO CLÁSSICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
STERN, Julio Michael. Paraconsistent sensitivity analysis for Bayesian significance tests. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-28645-5_14. Acesso em: 12 nov. 2024.
APA
Stern, J. M. (2004). Paraconsistent sensitivity analysis for Bayesian significance tests. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-28645-5_14
NLM
Stern JM. Paraconsistent sensitivity analysis for Bayesian significance tests [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-28645-5_14
Vancouver
Stern JM. Paraconsistent sensitivity analysis for Bayesian significance tests [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-28645-5_14
Trabalho de evento
Packing problems with orthogonal rotations (2004)
Miyazawa, Flavio Keidi ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, EMPACOTAMENTO E COBERTURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIYAZAWA, Flavio Keidi e WAKABAYASHI, Yoshiko. Packing problems with orthogonal rotations. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24698-5_40. Acesso em: 12 nov. 2024.
APA
Miyazawa, F. K., & Wakabayashi, Y. (2004). Packing problems with orthogonal rotations. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24698-5_40
NLM
Miyazawa FK, Wakabayashi Y. Packing problems with orthogonal rotations [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_40
Vancouver
Miyazawa FK, Wakabayashi Y. Packing problems with orthogonal rotations [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-24698-5_40
Trabalho de evento
High-level robot programming: an abductive approach using event calculus (2004)
Pereira, Silvio do Lago; Barros, Leliane Nunes de
Source: Proceedings. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidade: IME
Subjects: INTELIGÊNCIA ARTIFICIAL, PROGRAMAÇÃO LÓGICA, LINGUÍSTICA COMPUTACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PEREIRA, Silvio do Lago e BARROS, Leliane Nunes de. High-level robot programming: an abductive approach using event calculus. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-28645-5_8. Acesso em: 12 nov. 2024.
APA
Pereira, S. do L., & Barros, L. N. de. (2004). High-level robot programming: an abductive approach using event calculus. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-28645-5_8
NLM
Pereira S do L, Barros LN de. High-level robot programming: an abductive approach using event calculus [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-28645-5_8
Vancouver
Pereira S do L, Barros LN de. High-level robot programming: an abductive approach using event calculus [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-28645-5_8
Trabalho de evento
Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems (2004)
Cintra, Glauber Ferreira ; Wakabayashi, Yoshiko
Source: Proceedings. Conference titles: International Workshop on Experimental and Efficient Algorithms - WEA. Unidade: IME
Subjects: PROGRAMAÇÃO DINÂMICA, PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CINTRA, Glauber Ferreira e WAKABAYASHI, Yoshiko. Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24838-5_13. Acesso em: 12 nov. 2024.
APA
Cintra, G. F., & Wakabayashi, Y. (2004). Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24838-5_13
NLM
Cintra GF, Wakabayashi Y. Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_13
Vancouver
Cintra GF, Wakabayashi Y. Dynamic programming and column generation based approaches for two-dimensional guillotine cutting problems [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_13
Trabalho de evento
ProPAT: a programming ITS based on pedagogical patterns (2004)
Delgado, Karina Valdivia ; Barros, Leliane Nunes de
Source: Proceedings. Conference titles: International Conference on Intelligent Tutoring Systems - ITS. Unidade: IME
Subjects: METODOLOGIA E TÉCNICAS DE COMPUTAÇÃO, ENSINO E APRENDIZAGEM, RECONHECIMENTO DE PADRÕES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELGADO, Karina Valdivia e BARROS, Leliane Nunes de. ProPAT: a programming ITS based on pedagogical patterns. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-30139-4_84. Acesso em: 12 nov. 2024.
APA
Delgado, K. V., & Barros, L. N. de. (2004). ProPAT: a programming ITS based on pedagogical patterns. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-30139-4_84
NLM
Delgado KV, Barros LN de. ProPAT: a programming ITS based on pedagogical patterns [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-30139-4_84
Vancouver
Delgado KV, Barros LN de. ProPAT: a programming ITS based on pedagogical patterns [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-30139-4_84
Artigo de periodico
On a conjecture about the Gauss map of complete spacelike surfaces with constant mean curvature in the Lorentz-Minkowski space (2004)
Chaves, Rosa Maria dos Santos Barreiro ; Cândido, Cláudia Cueva
Source: Beitrage zur Algebra and Geometry. Unidade: IME
Assunto: GEOMETRIA GLOBAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHAVES, Rosa Maria dos Santos Barreiro e CÂNDIDO, Cláudia Cueva. On a conjecture about the Gauss map of complete spacelike surfaces with constant mean curvature in the Lorentz-Minkowski space. Beitrage zur Algebra and Geometry, v. 45, n. 1, p. 191-208, 2004Tradução . . Disponível em: https://www.emis.de/journals/BAG/vol.45/no.1/b45h1cha.pdf. Acesso em: 12 nov. 2024.
APA
Chaves, R. M. dos S. B., & Cândido, C. C. (2004). On a conjecture about the Gauss map of complete spacelike surfaces with constant mean curvature in the Lorentz-Minkowski space. Beitrage zur Algebra and Geometry, 45( 1), 191-208. Recuperado de https://www.emis.de/journals/BAG/vol.45/no.1/b45h1cha.pdf
NLM
Chaves RM dos SB, Cândido CC. On a conjecture about the Gauss map of complete spacelike surfaces with constant mean curvature in the Lorentz-Minkowski space [Internet]. Beitrage zur Algebra and Geometry. 2004 ; 45( 1): 191-208.[citado 2024 nov. 12 ] Available from: https://www.emis.de/journals/BAG/vol.45/no.1/b45h1cha.pdf
Vancouver
Chaves RM dos SB, Cândido CC. On a conjecture about the Gauss map of complete spacelike surfaces with constant mean curvature in the Lorentz-Minkowski space [Internet]. Beitrage zur Algebra and Geometry. 2004 ; 45( 1): 191-208.[citado 2024 nov. 12 ] Available from: https://www.emis.de/journals/BAG/vol.45/no.1/b45h1cha.pdf
Trabalho de evento
BSP/CGM algorithms for maximum subsequence and maximum subarray (2004)
Alves, Carlos Eduardo Rodrigues; Cáceres, Edson Norberto; Song, Siang Wun
Source: Proceedings. Conference titles: European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting - EuroPVM/MPI. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALVES, Carlos Eduardo Rodrigues e CÁCERES, Edson Norberto e SONG, Siang Wun. BSP/CGM algorithms for maximum subsequence and maximum subarray. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-30218-6_24. Acesso em: 12 nov. 2024.
APA
Alves, C. E. R., Cáceres, E. N., & Song, S. W. (2004). BSP/CGM algorithms for maximum subsequence and maximum subarray. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-30218-6_24
NLM
Alves CER, Cáceres EN, Song SW. BSP/CGM algorithms for maximum subsequence and maximum subarray [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-30218-6_24
Vancouver
Alves CER, Cáceres EN, Song SW. BSP/CGM algorithms for maximum subsequence and maximum subarray [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-30218-6_24
Artigo de periodico
A reduction theorem for highest weight modules over toroidal Lie algebras (2004)
Dimitrov, Ivan; Futorny, Vyacheslav ; Penkov, Ivan
Source: Communications in Mathematical Physics. Unidade: IME
Assunto: TEORIA DA REPRESENTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DIMITROV, Ivan e FUTORNY, Vyacheslav e PENKOV, Ivan. A reduction theorem for highest weight modules over toroidal Lie algebras. Communications in Mathematical Physics, v. 250, n. 1, p. 47-68, 2004Tradução . . Disponível em: https://doi.org/10.1007/s00220-004-1142-3. Acesso em: 12 nov. 2024.
APA
Dimitrov, I., Futorny, V., & Penkov, I. (2004). A reduction theorem for highest weight modules over toroidal Lie algebras. Communications in Mathematical Physics, 250( 1), 47-68. doi:10.1007/s00220-004-1142-3
NLM
Dimitrov I, Futorny V, Penkov I. A reduction theorem for highest weight modules over toroidal Lie algebras [Internet]. Communications in Mathematical Physics. 2004 ; 250( 1): 47-68.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/s00220-004-1142-3
Vancouver
Dimitrov I, Futorny V, Penkov I. A reduction theorem for highest weight modules over toroidal Lie algebras [Internet]. Communications in Mathematical Physics. 2004 ; 250( 1): 47-68.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/s00220-004-1142-3
Artigo de periodico
Parametric and nonparametric analyses of repeated ordinal categorical data (2004)
Singer, Júlio da Motta ; Poleto, Frederico Zanqueta; Rosa, Patrícia
Source: Biometrical Journal. Unidade: IME
Assunto: INFERÊNCIA NÃO PARAMÉTRICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SINGER, Júlio da Motta e POLETO, Frederico Zanqueta e ROSA, Patrícia. Parametric and nonparametric analyses of repeated ordinal categorical data. Biometrical Journal, v. 46, n. 4, p. 460-473, 2004Tradução . . Disponível em: https://doi.org/10.1002/bimj.200310045. Acesso em: 12 nov. 2024.
APA
Singer, J. da M., Poleto, F. Z., & Rosa, P. (2004). Parametric and nonparametric analyses of repeated ordinal categorical data. Biometrical Journal, 46( 4), 460-473. doi:10.1002/bimj.200310045
NLM
Singer J da M, Poleto FZ, Rosa P. Parametric and nonparametric analyses of repeated ordinal categorical data [Internet]. Biometrical Journal. 2004 ; 46( 4): 460-473.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1002/bimj.200310045
Vancouver
Singer J da M, Poleto FZ, Rosa P. Parametric and nonparametric analyses of repeated ordinal categorical data [Internet]. Biometrical Journal. 2004 ; 46( 4): 460-473.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1002/bimj.200310045
Trabalho de evento
Planning with abduction: a logical framework to explore extensions to classical planning (2004)
Pereira, Silvio do Lago; Barros, Leliane Nunes de
Source: Proceedings. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidade: IME
Subjects: INTELIGÊNCIA ARTIFICIAL, PROGRAMAÇÃO LÓGICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PEREIRA, Silvio do Lago e BARROS, Leliane Nunes de. Planning with abduction: a logical framework to explore extensions to classical planning. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-28645-5_7. Acesso em: 12 nov. 2024.
APA
Pereira, S. do L., & Barros, L. N. de. (2004). Planning with abduction: a logical framework to explore extensions to classical planning. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-28645-5_7
NLM
Pereira S do L, Barros LN de. Planning with abduction: a logical framework to explore extensions to classical planning [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-28645-5_7
Vancouver
Pereira S do L, Barros LN de. Planning with abduction: a logical framework to explore extensions to classical planning [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-28645-5_7
Trabalho de evento
Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm (2004)
Hanashiro, Erik J; Mongelli, Henrique ; Song, Siang Wun
Source: Proceedings. Conference titles: International Workshop on Experimental and Efficient Algorithms - WEA. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HANASHIRO, Erik J e MONGELLI, Henrique e SONG, Siang Wun. Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-24838-5_19. Acesso em: 12 nov. 2024.
APA
Hanashiro, E. J., Mongelli, H., & Song, S. W. (2004). Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-24838-5_19
NLM
Hanashiro EJ, Mongelli H, Song SW. Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_19
Vancouver
Hanashiro EJ, Mongelli H, Song SW. Efficient implementation of the BSP/CGM parallel vertex cover FPT algorithm [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-24838-5_19
Artigo de periodico
Maslov index and Morse theory for the relativistic Lorentz force equation (2004)
Caponio, Erasmo; Masiello, Antônio; Piccione, Paolo
Source: Manuscripta Mathematica. Unidade: IME
Assunto: GEOMETRIA DIFERENCIAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAPONIO, Erasmo e MASIELLO, Antônio e PICCIONE, Paolo. Maslov index and Morse theory for the relativistic Lorentz force equation. Manuscripta Mathematica, v. 113, n. 4, p. 471-506, 2004Tradução . . Disponível em: https://doi.org/10.1007/s00229-004-0441-5. Acesso em: 12 nov. 2024.
APA
Caponio, E., Masiello, A., & Piccione, P. (2004). Maslov index and Morse theory for the relativistic Lorentz force equation. Manuscripta Mathematica, 113( 4), 471-506. doi:10.1007/s00229-004-0441-5
NLM
Caponio E, Masiello A, Piccione P. Maslov index and Morse theory for the relativistic Lorentz force equation [Internet]. Manuscripta Mathematica. 2004 ; 113( 4): 471-506.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/s00229-004-0441-5
Vancouver
Caponio E, Masiello A, Piccione P. Maslov index and Morse theory for the relativistic Lorentz force equation [Internet]. Manuscripta Mathematica. 2004 ; 113( 4): 471-506.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/s00229-004-0441-5
Trabalho de evento
Inconsistency analysis for statistical tests of hypotheses (2004)
Stern, Julio Michael
Source: Proceedings. Conference titles: International Conference on Soft Methods in Probability and Statistics. Unidade: IME
Assunto: TESTES DE HIPÓTESES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
STERN, Julio Michael. Inconsistency analysis for statistical tests of hypotheses. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-44465-7_70. Acesso em: 12 nov. 2024.
APA
Stern, J. M. (2004). Inconsistency analysis for statistical tests of hypotheses. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-44465-7_70
NLM
Stern JM. Inconsistency analysis for statistical tests of hypotheses [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-44465-7_70
Vancouver
Stern JM. Inconsistency analysis for statistical tests of hypotheses [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-44465-7_70
Trabalho de evento
MobiGrid: framework for mobile agents on computer grid environments (2004)
Barbosa, Rodrigo Moreira; Goldman, Alfredo
Source: Proceedings. Conference titles: International Workshop on Mobile Agents for Telecommunication Applications - MATA. Unidade: IME
Subjects: PROGRAMAÇÃO PARALELA, COMPUTAÇÃO APLICADA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BARBOSA, Rodrigo Moreira e GOLDMAN, Alfredo. MobiGrid: framework for mobile agents on computer grid environments. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-30178-3_14. Acesso em: 12 nov. 2024.
APA
Barbosa, R. M., & Goldman, A. (2004). MobiGrid: framework for mobile agents on computer grid environments. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-30178-3_14
NLM
Barbosa RM, Goldman A. MobiGrid: framework for mobile agents on computer grid environments [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-30178-3_14
Vancouver
Barbosa RM, Goldman A. MobiGrid: framework for mobile agents on computer grid environments [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-30178-3_14
Trabalho de evento
A mobile agent infrastructure for QoS negociation of adaptive distributed applications (2004)
Cardoso, Roberto Speicys; Kon, Fábio
Source: Proceedings. Conference titles: OTM Confederated International Conferences, CoopIS, DOA, and ODBASE. Unidade: IME
Assunto: COMPUTAÇÃO UBÍQUA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CARDOSO, Roberto Speicys e KON, Fábio. A mobile agent infrastructure for QoS negociation of adaptive distributed applications. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-30469-2_47. Acesso em: 12 nov. 2024.
APA
Cardoso, R. S., & Kon, F. (2004). A mobile agent infrastructure for QoS negociation of adaptive distributed applications. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-30469-2_47
NLM
Cardoso RS, Kon F. A mobile agent infrastructure for QoS negociation of adaptive distributed applications [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-30469-2_47
Vancouver
Cardoso RS, Kon F. A mobile agent infrastructure for QoS negociation of adaptive distributed applications [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-30469-2_47
Trabalho de evento
Using relevance to speed up inference: some empirical results (2004)
Riani, Joselyto; Wassermann, Renata
Source: Proceedings. Conference titles: Brazilian Symposium on Artificial Intelligence - SBIA. Unidade: IME
Subjects: INTELIGÊNCIA ARTIFICIAL, PROVA AUTOMÁTICA DE TEOREMAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RIANI, Joselyto e WASSERMANN, Renata. Using relevance to speed up inference: some empirical results. 2004, Anais.. Berlin: Springer, 2004. Disponível em: https://doi.org/10.1007/978-3-540-28645-5_3. Acesso em: 12 nov. 2024.
APA
Riani, J., & Wassermann, R. (2004). Using relevance to speed up inference: some empirical results. In Proceedings. Berlin: Springer. doi:10.1007/978-3-540-28645-5_3
NLM
Riani J, Wassermann R. Using relevance to speed up inference: some empirical results [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-28645-5_3
Vancouver
Riani J, Wassermann R. Using relevance to speed up inference: some empirical results [Internet]. Proceedings. 2004 ;[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/978-3-540-28645-5_3
Artigo de periodico
Banach spaces of continuous functions with few operators (2004)
Koszmider, Piotr Boleslaw
Source: Mathematische Annalen. Unidade: IME
Assunto: ESPAÇOS DE BANACH
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOSZMIDER, Piotr Boleslaw. Banach spaces of continuous functions with few operators. Mathematische Annalen, v. 330, n. 1, p. 151-183, 2004Tradução . . Disponível em: https://doi.org/10.1007/s00208-004-0544-z. Acesso em: 12 nov. 2024.
APA
Koszmider, P. B. (2004). Banach spaces of continuous functions with few operators. Mathematische Annalen, 330( 1), 151-183. doi:10.1007/s00208-004-0544-z
NLM
Koszmider PB. Banach spaces of continuous functions with few operators [Internet]. Mathematische Annalen. 2004 ; 330( 1): 151-183.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/s00208-004-0544-z
Vancouver
Koszmider PB. Banach spaces of continuous functions with few operators [Internet]. Mathematische Annalen. 2004 ; 330( 1): 151-183.[citado 2024 nov. 12 ] Available from: https://doi.org/10.1007/s00208-004-0544-z

USP Schools

ReP

Filtros

Departament

Authors

USP affiliated authors

Subjects

Source title

Conference titles

Funding Agencies

Non normalized affiliation