Sciweavers

805 search results - page 64 / 161
» Semantics-based code search
Sort
View
OOPSLA
2010
Springer
14 years 8 months ago
Managing ambiguity in programming by finding unambiguous examples
We propose a new way to raise the level of discourse in the programming process: permit ambiguity, but manage it by linking it to unambiguous examples. This allows programming env...
Kenneth C. Arnold, Henry Lieberman
PPSN
2000
Springer
15 years 1 months ago
Genetic Programming Bloat without Semantics
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype)...
William B. Langdon, Wolfgang Banzhaf
IJBRA
2006
61views more  IJBRA 2006»
14 years 9 months ago
Finding functional promoter motifs by computational methods: a word of caution
: The standard practice in the analysis of promoters is to select promoter regions of convenient length. This may lead to false results when searching for Transcription Factor Bind...
Rajesh Chowdhary, Limsoon Wong, Vladimir B. Bajic
JPDC
2006
117views more  JPDC 2006»
14 years 9 months ago
Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver
We address the problem of efficient out-of-core code generation for a special class of imperfectly nested loops encoding tensor contractions arising in quantum chemistry computati...
Sandhya Krishnan, Sriram Krishnamoorthy, Gerald Ba...
NN
2011
Springer
348views Neural Networks» more  NN 2011»
14 years 4 months ago
Tree-like hierarchical associative memory structures
In this letter we explore an alternative structural representation for Steinbuch-type binary associative memories. These networks offer very generous storage capacities (both asy...
João Sacramento, Andreas Wichert