2657 search results - page 354 / 532 » On the complexity of hierarchical problem solving |
191
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
The ability to compute the parasitic inductance of the interconnect is critical to the timing verification of modern VLSI circuits. A challenging aspect of inductance extraction i...
205
Voted
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
206
Voted
CEC
2009
IEEE
16 years 1 months ago
2009
IEEE
— Despite their success as optimization methods, evolutionary algorithms face many difficulties to design artifacts with complex structures. According to paleontologists, living...
154
Voted
PRDC
2007
IEEE
16 years 1 months ago
2007
IEEE
Failure detector class Ωk has been defined in [18] as an extension to failure detector Ω, and an algorithm has been given in [16] to solve k-set agreement using Ωk in async...
187
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Thirteen years have passed since Karl Sims published his work on evolving virtual creatures. Since then, several novel approaches to neural network evolution and genetic algorithm...