Sciweavers

908 search results - page 126 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
114
Voted
DAC
2006
ACM
16 years 4 months ago
Design space exploration using time and resource duality with the ant colony optimization
Design space exploration during high level synthesis is often conducted through ad-hoc probing of the solution space using some scheduling algorithm. This is not only time consumi...
Gang Wang, Wenrui Gong, Brian DeRenzi, Ryan Kastne...
131
Voted
ATAL
2010
Springer
15 years 4 months ago
Coalition formation with spatial and temporal constraints
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is...
Sarvapali D. Ramchurn, Maria Polukarov, Alessandro...
214
Voted
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
15 years 4 months ago
Towards high speed multiobjective evolutionary optimizers
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder
131
Voted
GECCO
2007
Springer
276views Optimization» more  GECCO 2007»
15 years 9 months ago
Meta-optimizing semantic evolutionary search
I present MOSES (meta-optimizing semantic evolutionary search), a new probabilistic modeling (estimation of distribution) approach to program evolution. Distributions are not esti...
Moshe Looks
134
Voted
ICIP
2010
IEEE
15 years 1 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...