Sciweavers

446 search results - page 47 / 90
» Using a genetic algorithm approach to solve the dynamic chan...
Sort
View
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
14 years 1 months ago
Explaining and Controlling Ambiguity in Dynamic Programming
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...
Robert Giegerich
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 8 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin
CEC
2007
IEEE
14 years 3 months ago
A Memetic Algorithm for test data generation of Object-Oriented software
— Generating test data for Object-Oriented (OO) software is a hard task. Little work has been done on the subject, and a lot of open problems still need to be investigated. In th...
Andrea Arcuri, Xin Yao
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
14 years 1 months ago
Optimization of dynamic memory managers for embedded systems using grammatical evolution
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
José L. Risco-Martín, David Atienza,...
EVOW
2004
Springer
14 years 2 months ago
Top-Down Evolutionary Image Segmentation Using a Hierarchical Social Metaheuristic
Abstract. This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, w...
Abraham Duarte, Ángel Sánchez, Felip...