Buscar
Mostrando ítems 1-10 de 457
Graph searching: breadth first and depth first
(Wolfram Demonstration Project, 2016)
Graph searching: breadth first and depth first
(Wolfram Demonstration Project, 2011)
Uma investigação de algoritmos exatos e metaheurísticos aplicados ao nonograma
(Universidade Federal do Rio Grande do NorteBRUFRNPrograma de Pós-Graduação em Sistemas e ComputaçãoCiência da Computação, 2013-02-01)
Nonogram is a logical puzzle whose associated decision problem is NP-complete. It has
applications in pattern recognition problems and data compression, among others. The
puzzle consists in determining an assignment of ...
PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH
(EDP SCIENCES S A, 2010)
We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without ...
DptOIE: a portuguese Open Information Extraction system based on dependency analysis
(2019-10-09)
It is estimated that more than 80% of the information on the Web is stored in textual form. For humans, the task of extracting useful information from data that comes up daily is difficult. In order to automate the process, ...
Formas cuadráticas unitarias de tipo An: un enfoque combinatorioCuadratic unit forms of type An: a combinational aproach
(Universidad Autónoma del Estado de Morelos, 2014)
Formas cuadráticas unitarias de tipo An: un enfoque combinatorioCuadratic unit forms of type An: a combinational aproach
(Universidad Autónoma del Estado de Morelos, 2014)