Sciweavers

3142 search results - page 62 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
AINA
2005
IEEE
15 years 5 months ago
Efficient Secret Sharing with Access Structures in a Hierarchy
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
Chu-Hsing Lin, Wei Lee
MCS
2008
Springer
14 years 11 months ago
A nonsmooth Newton's method for control-state constrained optimal control problems
We investigate optimal control problems subject to mixed control-state constraints. The necessary conditions are stated in terms of a local minimum principle. By use of the Fischer...
Matthias Gerdts
ICC
2011
IEEE
272views Communications» more  ICC 2011»
13 years 11 months ago
Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
Kavitha Bhaskaran, Joan Triay, Vinod Vokkarane
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 3 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
WSC
2008
15 years 2 months ago
Discrete stochastic optimization using linear interpolation
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
Honggang Wang, Bruce W. Schmeiser