2520 search results - page 390 / 504 » The complexity of approximating entropy |
136
click to vote
ISNN
2009
Springer
15 years 11 months ago
2009
Springer
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
147
click to vote
KSEM
2009
Springer
15 years 11 months ago
2009
Springer
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
177
click to vote
MIG
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Despite the large success of games grounded on movement-based interactions the current state of full body motion capture technologies still prevents the exploitation of p...
130
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
119
click to vote
APLAS
2009
ACM
15 years 11 months ago
2009
ACM
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...