Sciweavers

17 search results - page 1 / 4
» Fast Moreau envelope computation I: numerical algorithms
Sort
View
NA
2006
84views more  NA 2006»
13 years 5 months ago
Fast Moreau envelope computation I: numerical algorithms
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
Yves Lucet
AIPS
2004
13 years 7 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
13 years 11 months ago
Search space modulation in genetic algorithms: evolving the search space by sinusoidal transformations
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
José Antonio Martin H.
SIAMREV
2010
140views more  SIAMREV 2010»
13 years 14 days ago
What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications
Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we ...
Yves Lucet
CVPR
2008
IEEE
14 years 7 months ago
Fast and robust numerical solutions to minimal problems for cameras with radial distortion
A number of minimal problems of structure from motion for cameras with radial distortion have recently been studied and solved in some cases. These problems are known to be numeri...
Karl Åström, Klas Josephson, Martin Byr...