9477 search results - page 3 / 1896 » Design is as Easy as Optimization |
SIGCSE
1999
ACM
13 years 10 months ago
1999
ACM
IJON
2006
13 years 6 months ago
2006
Equivariant Adaptive Separation via Independence (EASI) is one of the most successful algorithms for Blind Source Separation (BSS). However, the user has to choose nonlinearities,...
NIPS
2007
13 years 7 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
HM
2009
Springer
13 years 11 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
GECCO
2008
Springer
13 years 7 months ago
2008
Springer
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...