Sciweavers

1289 search results - page 138 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
14 years 11 months ago
ASAGA: an adaptive surrogate-assisted genetic algorithm
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
Liang Shi, Khaled Rasheed
GECCO
2008
Springer
144views Optimization» more  GECCO 2008»
14 years 11 months ago
Multi-resistant radar jamming using genetic algorithms
The next generation of advanced self-protection jammers is expected to deliver effective and energy efficient jamming against modern air tracking radars. However, optimizing such ...
Hans Jonas Fossum Moen, Stein Kristoffersen
EOR
2006
87views more  EOR 2006»
14 years 10 months ago
Applying machine based decomposition in 2-machine flow shops
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
Saral Mukherjee, A. K. Chatterjee
ICIP
2003
IEEE
15 years 11 months ago
Near-optimal multipath streaming of H.264 using reference frame selection
New video codink standards such as H.264 offer the flexibility to select from a number of reference frames for motion-estimation for a given predicted frame. In this paper, we pro...
Gene Cheung
SAC
2010
ACM
15 years 4 months ago
A simple role mining algorithm
Complex organizations need to establish access control policies in order to manage access to restricted resources. Role Based Access Control paradigm has been introduced in ’90 ...
Carlo Blundo, Stelvio Cimato