Sciweavers

1083 search results - page 65 / 217
» On the Number of Optimal Base 2 Representations of Integers
Sort
View
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
15 years 7 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
14 years 1 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
15 years 2 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
EPIA
2007
Springer
15 years 4 months ago
Evaluating Simulated Annealing Algorithms in the Optimization of Bacterial Strains
Abstract. In this work, a Simulated Annealing (SA) algorithm is proposed for a Metabolic Engineering task: the optimization of the set of gene deletions to apply to a microbial str...
Miguel Rocha, Rui Mendes, Paulo Maia, José ...
ENDM
2010
136views more  ENDM 2010»
14 years 10 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen