Sciweavers

14518 search results - page 2 / 2904
» Two Problems for Sophistication
Sort
View
ANOR
2010
123views more  ANOR 2010»
13 years 5 months ago
Nature inspired genetic algorithms for hard packing problems
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
Philipp Rohlfshagen, John A. Bullinaria
GECCO
2003
Springer
124views Optimization» more  GECCO 2003»
13 years 10 months ago
Study Diploid System by a Hamiltonian Cycle Problem Algorithm
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
Dong Xianghui, Ruwei Dai
SWSTE
2005
IEEE
13 years 10 months ago
Mapping Structures for Flash Memories: Techniques and Open Problems
Flash memory is a type of electrically erasable programmable read-only memory (EEPROM). Because flash memories are nonvolatile and relatively dense, they are now used to store ï¬...
Eran Gal, Sivan Toledo
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 2 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
AI
2001
Springer
13 years 9 months ago
Concept-Learning in the Presence of Between-Class and Within-Class Imbalances
In a concept learning problem, imbalances in the distribution of the data can occur either between the two classes or within a single class. Yet, although both types of imbalances ...
Nathalie Japkowicz