Buscar
Mostrando ítems 1-10 de 444
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 ...
Exact Algorithms for the Graph Coloring Problem
(Instituto de Informática - Universidade Federal do Rio Grande do Sul, 2018)
A LINEAR-TIME ALGORITHM FOR PROPER INTERVAL GRAPH RECOGNITION
(Elsevier Science BvAmsterdamHolanda, 1995)
Time-bounded best-first search for reversible and non-reversible search graphs
(AI Access Foundation, 2016-08)
Time-Bounded A* is a real-time, single-agent, deterministic search algorithm that expands
states of a graph in the same order as A* does, but that unlike A* interleaves search and action exe cution. Known to outperform ...
A graph-based approach for transcribing ancient documents
(Springer Verlag, 2012)
Over the last years, the interest in preserving digitally ancient documents has increased resulting in databases with a huge amount of image data. Most of these documents are not transcribed and thus querying operations ...
Riverbed: A Novel User-Steered Image Segmentation Method Based on Optimum Boundary Tracking
(IEEE-Inst Electrical Electronics Engineers IncPiscataway, 2012)
Optimized test suites for automated testing using different optimization techniques
Automated testing mitigates the risk of test maintenance failure, selects the optimized test suite, improves efficiency and hence reduces cost and time consumption. This paper is based on the development of an automated ...
Riverbed: A Novel User-Steered Image Segmentation Method Based on Optimum Boundary Tracking
(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCPISCATAWAY, 2012)
This paper presents an optimum user-steered boundary tracking approach for image segmentation, which simulates the behavior of water flowing through a riverbed. The riverbed approach was devised using the image foresting ...
Time-Bounded Best-First Search for Reversible and Non-reversible Search Graphs
(2016)
Time-Bounded A* is a real-time, single-agent, deterministic search algorithm that expands states of a graph in the same order as A* does, but that unlike A* interleaves search and action execution. Known to outperform ...