107 search results - page 2 / 22 » Upper Bounds on the Time and Space Complexity of Optimizing ... |
IPPS
2000
IEEE
13 years 10 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
CEC
2007
IEEE
14 years 3 days ago
2007
IEEE
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
JMLR
2008
13 years 5 months ago
2008
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
ICALP
2004
Springer
13 years 11 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
JC
2007
13 years 5 months ago
2007
We construct simple algorithms for high-dimensional numerical integration of function classes with moderate smoothness. These classes consist of square-integrable functions over t...