Sciweavers

15485 search results - page 502 / 3097
» Computing Optimal Subsets
Sort
View
179
Voted
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 10 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
GECCO
2008
Springer
363views Optimization» more  GECCO 2008»
15 years 8 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
MP
1998
73views more  MP 1998»
15 years 6 months ago
On proving existence of feasible points in equality constrained optimization problems
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
R. Baker Kearfott
MP
2006
103views more  MP 2006»
15 years 6 months ago
Assessing solution quality in stochastic programs
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...
Güzin Bayraksan, David P. Morton
DCC
2003
IEEE
16 years 6 months ago
Rate-distortion Optimized Packet Scheduling and Routing for Media Streaming with Path Diversity
We consider diversity for media streaming in a rate-distortion optimization framework. A sender-driven transmission scenario is investigated, where diversity is achieved by using ...
Jacob Chakareski, Bernd Girod