19320 search results - page 63 / 3864 » On the complexity of computing determinants |
WDAG
2005
Springer
15 years 3 months ago
2005
Springer
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
CEC
2007
IEEE
14 years 10 months ago
2007
IEEE
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
GLVLSI
2009
IEEE
15 years 4 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
HICSS
2007
IEEE
15 years 4 months ago
2007
IEEE
In any forensic investigation, planning and analysis activities are required in order to determine what digital media will be seized, what types of information will be sought in t...