Sciweavers

14739 search results - page 302 / 2948
» An optimization problem on the sphere
Sort
View
COCOON
2007
Springer
16 years 11 days ago
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Yuli Ye, Allan Borodin
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
16 years 10 days ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
AE
2005
Springer
15 years 11 months ago
Memetic Algorithms for the MinLA Problem
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
CPAIOR
2005
Springer
15 years 11 months ago
Shorter Path Constraints for the Resource Constrained Shortest Path Problem
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...
Thorsten Gellermann, Meinolf Sellmann, Robert Wrig...
GECCO
2004
Springer
122views Optimization» more  GECCO 2004»
15 years 11 months ago
Gradient-Based Learning Updates Improve XCS Performance in Multistep Problems
This paper introduces a gradient-based reward prediction update mechanism to the XCS classifier system as applied in neuralnetwork type learning and function approximation mechani...
Martin V. Butz, David E. Goldberg, Pier Luca Lanzi