2657 search results - page 54 / 532 » On the complexity of hierarchical problem solving |
SEMWEB
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Military training and testing events are highly complex affairs, potentially involving dozens of legacy systems that need to interoperate in a meaningful way. There are s...
104
click to vote
ICML
1994
IEEE
15 years 5 months ago
1994
IEEE
This paper presents an approach to automatic discovery of functions in Genetic Programming. The approach is based on discovery of useful building blocks by analyzing the evolution...
134
click to vote
ICPADS
2007
IEEE
15 years 7 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
PAIRING
2007
Springer
15 years 7 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
108
click to vote
CGF
1998
15 years 1 months ago
1998
Hierarchical radiosity with clustering has positioned itself as one of the most efficient algorithms for computing global illumination in non-trivial environments. However, using...