Sciweavers

3433 search results - page 427 / 687
» Heuristics for a bidding problem
Sort
View
GECCO
2007
Springer
153views Optimization» more  GECCO 2007»
16 years 27 days ago
Analyzing the effects of module encapsulation on search space bias
Modularity is thought to improve the evolvability of biological systems [18, 22]. Recent studies in the field of evolutionary computation show that the use of modularity improves...
Ozlem O. Garibay, Annie S. Wu
KI
2007
Springer
16 years 27 days ago
Inductive Synthesis of Recursive Functional Programs
Abstract. We compare three systems for the task of synthesising functional recursive programs, namely Adate, an approach through evolutionary computation, the classification learn...
Martin Hofmann 0008, Andreas Hirschberger, Emanuel...
LION
2007
Springer
138views Optimization» more  LION 2007»
16 years 27 days ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
SLS
2007
Springer
111views Algorithms» more  SLS 2007»
16 years 26 days ago
Mixed Models for the Analysis of Local Search Components
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
Jørgen Bang-Jensen, Marco Chiarandini, Yuri...
WINE
2007
Springer
166views Economy» more  WINE 2007»
16 years 26 days ago
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
Andrew Gilpin, Samid Hoda, Javier Peña, Tuo...