Sciweavers

17760 search results - page 80 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
GECCO
2010
Springer
168views Optimization» more  GECCO 2010»
15 years 6 months ago
On the generality of parameter tuning in evolutionary planning
Divide-and-Evolve (DaE) is an original “memeticization” of Evolutionary Computation and Artificial Intelligence Planning. However, like any Evolutionary Algorithm, DaE has se...
Jacques Bibai, Pierre Savéant, Marc Schoena...
CP
2001
Springer
15 years 6 months ago
A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
Rina Dechter, Kalev Kask, Javier Larrosa
AVBPA
1997
Springer
113views Biometrics» more  AVBPA 1997»
15 years 5 months ago
Generalized Likelihood Ratio-based Face Detection and Extraction of Mouth Features
In this paper we describe a system to reliably localize the position of the speaker’s face and mouth in videophone sequences. A statistical scheme based on a subspace method is p...
Charles Kervrann, Franck Davoine, P. Pérez,...
ASPDAC
2001
ACM
104views Hardware» more  ASPDAC 2001»
15 years 5 months ago
Optimal spacing and capacitance padding for general clock structures
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
Yu-Min Lee, Hing Yin Lai, Charlie Chung-Ping Chen
ASIACRYPT
2008
Springer
15 years 3 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...