Sciweavers

7519 search results - page 50 / 1504
» Optimizing Generic Functions
Sort
View
AI
2010
Springer
13 years 9 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
GECCO
2010
Springer
199views Optimization» more  GECCO 2010»
14 years 2 months ago
A comparative study: function approximation with LWPR and XCSF
Patrick O. Stalph, Jérémie Rubinszta...
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
13 years 10 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...
TOOLS
2000
IEEE
14 years 2 months ago
Generic Components to Foster Reuse
Software reuse and especially the paradigm of software components are promising approaches to increase the efficiency of software development. One of the basic problems of softwar...
Lothar Baum, Martin Becker
ASIACRYPT
2008
Springer
13 years 11 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...