668 search results - page 79 / 134 » Algorithmics and Applications of Tree and Graph Searching |
123
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
108
click to vote
JDWM
2007
15 years 2 months ago
2007
This article presents a new evolutionary algorithm (EA) for induction of mixed decision trees. In nonterminal nodes of a mixed tree, different types of tests can be placed, rangin...
180
click to vote
CP
2004
Springer
15 years 8 months ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...
126
Voted
ICPP
2008
IEEE
15 years 9 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
152
click to vote
AC
2000
Springer
15 years 6 months ago
2000
Springer
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...