Sciweavers

1155 search results - page 76 / 231
» Continuous dynamic problem generators for evolutionary algor...
Sort
View
132
Voted
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
13 years 3 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
107
Voted
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 6 months ago
A novel generative encoding for exploiting neural network sensor and output geometry
A significant problem for evolving artificial neural networks is that the physical arrangement of sensors and effectors is invisible to the evolutionary algorithm. For example,...
David B. D'Ambrosio, Kenneth O. Stanley
109
Voted
DASFAA
2009
IEEE
203views Database» more  DASFAA 2009»
15 years 7 months ago
Adaptive Safe Regions for Continuous Spatial Queries over Moving Objects
Abstract. Continuous spatial queries retrieve a set of time-varying objects continuously during a given period of time. However, monitoring moving objects to maintain the correctne...
Yu-Ling Hsueh, Roger Zimmermann, Wei-Shinn Ku
96
Voted
CSL
2004
Springer
15 years 4 months ago
Pfaffian Hybrid Systems
It is well known that in an o-minimal hybrid system the continuous and discrete components can be separated, and therefore the problem of finite bisimulation reduces to the same pr...
Margarita V. Korovina, Nicolai Vorobjov
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 20 days ago
Mean field for Markov Decision Processes: from Discrete to Continuous Optimization
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
Nicolas Gast, Bruno Gaujal, Jean-Yves Le Boudec