1204 search results - page 106 / 241 » Termination of Polynomial Programs |
125
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be com...
124
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
113
Voted
GECCO
1999
Springer
15 years 5 months ago
1999
Springer
This paper uses the GP paradigm to evolve linear genotypes (individuals) that consist of Java byte code. Our prototype GP system is implemented in Java using a standard Java devel...
120
click to vote
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
156
click to vote
AAIP
2009
15 years 1 months ago
2009
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...