Sciweavers

899 search results - page 61 / 180
» Advancements in multicode optimization
Sort
View
UAI
2008
14 years 11 months ago
Sensitivity analysis in decision circuits
Decision circuits have been developed to perform efficient evaluation of influence diagrams [Bhattacharjya and Shachter, 2007], building on the advances in arithmetic circuits for...
Debarun Bhattacharjya, Ross D. Shachter
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
14 years 11 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
COR
2008
88views more  COR 2008»
14 years 10 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
CONSTRAINTS
2006
120views more  CONSTRAINTS 2006»
14 years 9 months ago
Constraint Models for the Covering Test Problem
Covering arrays can be applied to the testing of software, hardware and advanced materials, and to the effects of hormone interaction on gene expression. In this paper we develop c...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
JGO
2010
121views more  JGO 2010»
14 years 8 months ago
The oracle penalty method
A new and universal penalty method is introduced in this contribution. It is especially intended to be applied in stochastic metaheuristics like genetic algorithms, particle swarm...
Martin Schlüter, Matthias Gerdts