Sciweavers

697 search results - page 50 / 140
» On the Theory of Average Case Complexity
Sort
View
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
13 years 8 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
14 years 2 months ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
14 years 1 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
TLCA
2005
Springer
14 years 1 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
IJCAI
2007
13 years 9 months ago
Analogical Learning in a Turn-Based Strategy Game
A key problem in playing strategy games is learning how to allocate resources effectively. This can be a difficult task for machine learning when the connections between actions a...
Thomas R. Hinrichs, Kenneth D. Forbus