Buscar
Mostrando ítems 1-10 de 6699
Dico: A Conceptual Model To Support The Design And Evaluation Of Advanced Search Features For Exploratory Search
(SPRINGER-VERLAG BERLINBERLIN, 2015)
Dico : um modelo conceitual para apoiar o design e a avaliação de recursos de busca avançada para pesquisa exploratóriaDico: A Conceptual Model to Support the Design and Evaluation of Advanced Search Features for Exploratory Search
(Universidade Estadual de MaringáBrasilDepartamento de InformáticaPrograma de Pós-Graduação em Ciência da ComputaçãoUEMMaringá, PRCentro de Tecnologia, 2018)
Search intensity versus search diversity: a false trade off?
(Springer, 2010-06)
An implicit tenet of modern search heuristics is that there is a mutually exclusive balance between two desirable goals: search diversity (or distribution), i.e., search through a maximum number of distinct areas, and, ...
Supporting exploratory search with a visual user-driven approach
(Association for Computing Machinery, 2017-12)
Whenever users engage in gathering and organizing new information, searching and browsing activities emerge at the core of the exploration process. As the process unfolds and new knowledge is acquired, interest drifts occur ...
Motores de búsqueda y servicios de Internet
(2017-08-31)
Descripción del tema 3 y 4 de la unidad 3 del contenido programático de
la informática I, encontrarás información acerca de los Motores de
búsqueda, las Búsquedas avanzadas, Proveedores de servicio de correo
electrónico, ...
NLP-based faceted search: Experience in the development of a science and technology search engine
(Elsevier, 2014-05)
An appropriate promotion, distribution and dissemination of scientific, artistic and technology developments can foster the collaboration between a country’s productive and academic sectors. The purpose of this paper is ...
Tabu search algorithm for network synthesis
(Institute of Electrical and Electronics Engineers (IEEE), 2000-05-01)
Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures ...
Tabu search algorithm for network synthesis
(Institute of Electrical and Electronics Engineers (IEEE), 2000-05-01)
Large scale combinatorial problems such as the network expansion problem present an amazingly high number of alternative configurations with practically the same investment, but with substantially different structures ...
A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
(World Scientific and Engineering Acad and Soc, 2009-01-01)
Assigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they ...
A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
(World Scientific and Engineering Acad and Soc, 2009-01-01)
Assigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they ...