1091 search results - page 26 / 219 » On the temporal dimension of search |
115
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
The BFGS quasi-Newton method is benchmarked on the noiseless BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of 105 times the sea...
131
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
The BFGS quasi-Newton method is benchmarked on the noisy BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of about 104 times the s...
115
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
The NEWUOA which belongs to the class of DerivativeFree optimization algorithms is benchmarked on the BBOB2009 noisy testbed. A multistart strategy is applied with a maximum numbe...
121
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
127
Voted
TIME
2007
IEEE
15 years 7 months ago
2007
IEEE
We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to ap...