Sciweavers

12825 search results - page 315 / 2565
» Improved PLSOM algorithm
Sort
View
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 7 months ago
Allowing Privacy Protection Algorithms to Jump Out of Local Optimums: An Ordered Greed Framework
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
Rhonda Chaytor
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
16 years 1 months ago
Evolutionary algorithms and multi-objectivization for the travelling salesman problem
This paper studies the multi-objectivization of single-objective optimization problems (SOOP) using evolutionary multi-objective algorithms (EMOAs). In contrast to the single-obje...
Martin Jähne, Xiaodong Li, Jürgen Branke
PKDD
2009
Springer
169views Data Mining» more  PKDD 2009»
16 years 1 months ago
Hybrid Least-Squares Algorithms for Approximate Policy Evaluation
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
Jeffrey Johns, Marek Petrik, Sridhar Mahadevan
ISVLSI
2007
IEEE
161views VLSI» more  ISVLSI 2007»
16 years 1 months ago
CMP-aware Maze Routing Algorithm for Yield Enhancement
— Chemical-Mechanical Polishing (CMP) is one of the key steps during nanometer VLSI manufacturing process where minimum variation of layout pattern densities is desired. This pap...
Hailong Yao, Yici Cai, Xianlong Hong
EUROGP
2007
Springer
135views Optimization» more  EUROGP 2007»
16 years 1 months ago
A Grammatical Genetic Programming Approach to Modularity in Genetic Algorithms
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
Erik Hemberg, Conor Gilligan, Michael O'Neill, Ant...