1114 search results - page 88 / 223 » Validating optimizations of concurrent C C programs |
147
Voted
CONSTRAINTS
2008
15 years 2 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
145
Voted
ISCAS
2011
IEEE
14 years 6 months ago
2011
IEEE
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
124
click to vote
ICVS
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. At the first ICVS, we presented SA-C (“sassy”), a singleassignment variant of the C programming language designed to exploit both coarse-grain and fine-grain parallel...
140
Voted
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
The original mechanism by which evolutionary algorithms were to solve problems was to allow for the gradual discovery of sub-solutions to sub-problems, and the automated combinati...
125
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
This paper presents a novel approach for knowledge mining from a sparse and repeated measures dataset. Genetic programming based symbolic regression is employed to generate multip...