381 search results - page 68 / 77 » Time Complexity of genetic algorithms on exponentially scale... |
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
109
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
95
Voted
AAAI
1996
15 years 28 days ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
91
Voted
CONCUR
2000
Springer
15 years 4 months ago
2000
Springer
In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a wellde ned productbehavior are ruled out. They ca...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...