536 search results - page 79 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
CDC
2008
IEEE
14 years 3 months ago
2008
IEEE
— We consider the problem of small-gain analysis of asymptotic behavior in interconnected nonlinear dynamic systems. Mathematical models of these systems are allowed to be uncert...
QEST
2010
IEEE
13 years 6 months ago
2010
IEEE
The method of stochastic state classes approaches the analysis of Generalised Semi Markov Processes (GSMP) through symbolic derivation of probability density functions over Differe...
JOC
2007
13 years 8 months ago
2007
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...