334 search results - page 41 / 67 » Efficient Algorithms for the Tree Homeomorphism Problem |
CF
2009
ACM
14 years 3 months ago
2009
ACM
As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems. The fundamental issue of...
ICDT
2010
ACM
13 years 11 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
CP
2009
Springer
14 years 9 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
TSMC
2008
13 years 8 months ago
2008
In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...