New algorithms for composite retrieval
Internet users constantly make searches to find objects or results of their interest, generally through terms or phrases. Traditional search offers only solutions that take into account just the individual characteristics of the results, and not the relations they have with the rest of the universe....
Guardado en:
Autores principales: | Feuerstein, E., Knebel, J.A., Mendez-Diaz, I., Stein, A., Zabala, P., Accenture; CONICYT; et al.; NIC Chile; RyC Consultores Asociados; Telefonica I+D |
---|---|
Formato: | CONF |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_97815090_v_n_p_Feuerstein |
Aporte de: |
Ejemplares similares
-
New algorithms for composite retrieval
por: Méndez Díaz, Isabel, et al.
Publicado: (2017) -
Recursive and iterative algorithms for N-ary search problems
por: Sklyarov, Valery, et al.
Publicado: (2006) -
A tabu search heuristic for the equitable coloring problem
por: Méndez Díaz, I., et al. -
A tabu search heuristic for the equitable coloring problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2014) -
A little respect (for the role of common components in heuristic search)
por: Chen, Stephen
Publicado: (2006)