1449 search results - page 120 / 290 » Self-Randomized Exponentiation Algorithms |
139
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
142
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Representing agent policies compactly is essential for improving the scalability of multi-agent planning algorithms. In this paper, we focus on developing a pruning technique that...
174
click to vote
ACSD
2007
IEEE
15 years 8 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
236
click to vote
DAMON
2008
Springer
15 years 8 months ago
2008
Springer
Critical sections in database storage engines impact performance and scalability more as the number of hardware contexts per chip continues to grow exponentially. With enough thre...
170
click to vote
NIPS
2008
15 years 7 months ago
2008
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...