Sciweavers

1289 search results - page 35 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
14 years 11 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
MOR
2007
116views more  MOR 2007»
13 years 10 months ago
Complex Matrix Decomposition and Quadratic Programming
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over sp...
Yongwei Huang, Shuzhong Zhang
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
14 years 5 months ago
Reducing the space-time complexity of the CMA-ES
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
James N. Knight, Monte Lunacek
ICRA
2007
IEEE
151views Robotics» more  ICRA 2007»
14 years 5 months ago
A Spatially Structured Genetic Algorithm over Complex Networks for Mobile Robot Localisation
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
Andrea Gasparri, Stefano Panzieri, Federica Pascuc...
FOCS
1990
IEEE
14 years 3 months ago
Complexity of Unification in Free Groups and Free Semi-groups
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
Antoni Koscielski, Leszek Pacholski