Sciweavers

3677 search results - page 526 / 736
» Is a probabilistic modeling
Sort
View
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 5 months ago
Accelerating genetic programming by frequent subtree mining
One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) whi...
Yoshitaka Kameya, Junichi Kumagai, Yoshiaki Kurata
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
15 years 5 months ago
iBOA: the incremental bayesian optimization algorithm
This paper proposes the incremental Bayesian optimization algorithm (iBOA), which modifies standard BOA by removing the population of solutions and using incremental updates of t...
Martin Pelikan, Kumara Sastry, David E. Goldberg
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 4 months ago
Where is Randomness Needed to Break the Square-Root Bottleneck?
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th...
Patrick Kuppinger, Giuseppe Durisi, Helmut Bö...
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 4 months ago
Bayesian Optimisation Algorithm for Nurse Scheduling
: Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimizatio...
Jingpeng Li, Uwe Aickelin
CVIU
2010
85views more  CVIU 2010»
15 years 4 months ago
Shading constraint improves accuracy of time-of-flight measurements
We describe a technique for improving the accuracy of range maps measured by time-of-flight (TOF) cameras. The technique is based on the observation that the range map and intensi...
Martin Böhme, Martin Haker, Thomas Martinetz,...