689 search results - page 4 / 138 » Focusing in Linear Meta-logic |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Recent results show that the Differential Evolution algorithm has significant difficulty on functions that are not linearly separable. On such functions, the algorithm must rely...
PAMI
2007
13 years 7 months ago
2007
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arr...
ENTCS
2011
13 years 2 months ago
2011
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, i...
ECCC
2011
12 years 11 months ago
2011
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...