Sciweavers

1404 search results - page 227 / 281
» Optimization problems in multiple-interval graphs
Sort
View
DATE
1999
IEEE
162views Hardware» more  DATE 1999»
15 years 2 months ago
MOCSYN: Multiobjective Core-Based Single-Chip System Synthesis
In this paper, we present a system synthesis algorithm, called MOCSYN, which partitions and schedules embedded system specifications to intellectual property cores in an integrate...
Robert P. Dick, Niraj K. Jha
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
15 years 1 months ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 1 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
AAAI
2010
14 years 11 months ago
Search-Based Path Planning with Homotopy Class Constraints
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
Subhrajit Bhattacharya
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
14 years 10 months ago
Enhanced generalized ant programming (EGAP)
This paper begins by reviewing different methods of automatic programming while emphasizing the technique of Ant Programming (AP). AP uses an ant foraging metaphor in which ants g...
Amirali Salehi-Abari, Tony White