skip to main content
Idioma:

Resultados 11 - 20 de 299  para Producción Intelectual USP

Ordenar por: Ordenar por: PopularidadOr hit Enter to replace sort method
previous page 1 Resultados 2 3 4 5 next page
Mostrar solo
Refinado por: Título de revista: Proceedings eliminar
Result Number Material Type Add to My Shelf Action Record Details and Options
11
Clustering exploratory activity in an elevated plus-maze with neural networks
Clustering exploratory activity in an elevated plus-maze with neural networks
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

Clustering exploratory activity in an elevated plus-maze with neural networks

André S. Henriques Aluízio Fausto Ribeiro Araújo; Sílvio Morato; International Joint Conference on Neural Networks (2000 Como)

Proceedings Los Alamitos : IEEE Computer Society, 2000

Los Alamitos IEEE Computer Science 2000

Comprobar fondos(Obténgalo)

12
MAMCost global and local estimates leading to robust cost estimation of similarity queries
MAMCost global and local estimates leading to robust cost estimation of similarity queries
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

MAMCost global and local estimates leading to robust cost estimation of similarity queries

Gisele Busichia Baioco Agma Juci Machado Traina; Caetano Traina Junior; International Conference on Scientific and Statistical Database Management (19 2007 Banff)

Proceedings Banff, 2007

Los Alamitos IEEE Computer Science 2007

Disponible en ICMC - Inst. Ciên. Mat. Computação    (PROD-1621741 ) y otras localizaciones(Obténgalo)

13
Analysis of the rhetorical structure of computer science abstracts in portuguese
Analysis of the rhetorical structure of computer science abstracts in portuguese
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

Analysis of the rhetorical structure of computer science abstracts in portuguese

Valéria Delisandra Feltrim Sandra Maria Aluísio; Maria das Graças Volpe Nunes; Corpus Linguistics 2003 Conference (2003 Lancaster)

Proceedings Lancaster: Lancaster University,2003

Lancaster Lancaster University 2003

Disponible en ICMC - Inst. Ciên. Mat. Computação    (PROD-1310567 ) y otras localizaciones(Obténgalo)

14
A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems

Cristina Gomes Fernandes 1966- Luis A. A Meira; Flavio Keidi Miyazawa; Lehilton L. C Pedrosa; International Workshop on Approximation Algorithms for Combinatorial Optimization - APPROX (15. 2012 Cambridge, MA); International Workshop on Randomization and Approximation Techniques in Computer Science - RANDOM (16. 2012 Cambridge, MA)

Proceedings Berlin : Springer, 2012

Berlin Springer 2012

Disponible en IME - Inst. Matemática e Estatística    (PROD-2306003 ) y otras localizaciones(Obténgalo)

15
Some approximation results for the maximum agreement forest problem
Some approximation results for the maximum agreement forest problem
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

Some approximation results for the maximum agreement forest problem

Estela Maris Rodrigues Marie-France Sagot; Yoshiko Wakabayashi; International Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2001 (4. 2001 Berkeley); International Workshop on Randomization and Approximation Techniques in Computer Science - RANDOM 2001 (5. 2001 Berkeley)

Proceedings Berlin: Springer, 2001

Berlin Springer 2001

Disponible en IME - Inst. Matemática e Estatística    (PROD-1241364 ) y otras localizaciones(Obténgalo)

16
Near-optimum universal graphs for graphs with bounded degrees
Near-optimum universal graphs for graphs with bounded degrees
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

Near-optimum universal graphs for graphs with bounded degrees

Noga Alon Michael Capalbo; Yoshiko Wakabayashi; Vojtech Rodl; Andrzej Rucinski; Endre Szemerédi; International Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2001 (4. 2001 Berkeley); International Workshop on Randomization and Approximation Techniques in Computer Science - RANDOM 2001 (5. 2001 Berkeley)

Proceedings Berlin: Springer, 2001

Berlin Springer 2001

Disponible en IME - Inst. Matemática e Estatística    (PROD-1241370 ) y otras localizaciones(Obténgalo)

17
Properties of factorization forests
Properties of factorization forests
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

Properties of factorization forests

Imre Simon 1943-2009 Spring School on Theoretical Computer Science - LITP (1988 Ramatuelle, France)

Proceedings Berlin : Springer, 1989

Berlin Springer 1989

Disponible en IME - Inst. Matemática e Estatística    (S L471c v.386 ) y otras localizaciones(Obténgalo)

18
String matching algorithms and automata
String matching algorithms and automata
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

String matching algorithms and automata

Imre Simon 1943-2009 Results and Trends in Theoretical Computer Science : Colloquium in Honor of Arto Salomaa Graz (1994 Graz, Austria)

Proceedings Berlin: Springer, 1994

Berlin Springer 1994

Disponible en IME - Inst. Matemática e Estatística    (PROD-2968564 )(Obténgalo)

19
Covering a graph with nontrivial vertex-disjoint paths existence and optimization
Covering a graph with nontrivial vertex-disjoint paths existence and optimization
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

Covering a graph with nontrivial vertex-disjoint paths existence and optimization

Renzo Gómez Yoshiko Wakabayashi; International Workshop on Graph-Theoretic Concepts in Computer Science - WG (44. 2018 Cottbus, Germany)

Proceedings Cham: Springer, 2018

Cham Springer 2018

Disponible en IME - Inst. Matemática e Estatística    (PROD-2912608 )(Obténgalo)

20
The UPS problem
The UPS problem
Material Type:
Artículo de Congreso 		Añadir a Mi Portal

The UPS problem

Cristina Gomes Fernandes 1966- Till Nierho; Annual Symposium on Theoretical Aspects of Computer Science - STACS (18. 2001 Dresden, Germany)

Proceedings Berlin : Springer, 2001

Berlin Springer 2001

Disponible en IME - Inst. Matemática e Estatística    (PROD-3033948 )(Obténgalo)

Resultados 11 - 20 de 299  para Producción Intelectual USP

Ordenar por: Ordenar por: PopularidadOr hit Enter to replace sort method
previous page 1 Resultados 2 3 4 5 next page

Personalizar los resultados

  1. Editar

Refine Search Results

Mostrar solo

  1. Disponible (283)
  2. Recursos en línea (14)

Refinar mis resultados

Tipo de Recurso 

  1. Artículos  (292)
  2. Libros  (7)
  3. Más opciones open sub menu

Fecha de Publicación 

De Hasta
Refinar
  1. Antes de1993  (10)
  2. 1993Hasta2000  (36)
  3. 2001Hasta2007  (72)
  4. 2008Hasta2015  (93)
  5. Después de 2015  (88)
  6. Más opciones open sub menu

Idioma 

  1. Inglés  (296)
  2. Portugués  (3)
  3. Más opciones open sub menu

  • Realización: ABCD-USP USP   Logos de Redes Sociales: Freepik

Buscando en bases de datos remotas, por favor espere