Sciweavers

1289 search results - page 10 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
13 years 11 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
WSC
2008
14 years 4 days ago
Simulation-based optimization of a complex mail transportation network
The Swedish Postal Services receives and distributes over 22 million pieces of mail every day. Mail transportation takes place overnight by airplanes, trains, trucks, and cars in ...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Martin And...
DAGSTUHL
2006
13 years 11 months ago
On Complexity of Optimized Crossover for Binary Representations
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
Anton V. Eremeev
DCC
2004
IEEE
14 years 9 months ago
On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
Martin Röder, Jean Cardinal, Raouf Hamzaoui
JC
2002
63views more  JC 2002»
13 years 9 months ago
On the Complexity of Exclusion Algorithms for Optimization
Exclusion algorithms are a well-known tool in the area of interval analysis for finding all solutions of a system of nonlinear equations or for finding the global minimum of a fun...
Eugene L. Allgower, Melissa Erdmann, Kurt Georg