Sciweavers

388 search results - page 15 / 78
» Program Analysis Using Symbolic Ranges
Sort
View
82
Voted
TNN
1998
125views more  TNN 1998»
14 years 9 months ago
Symbolic connectionism in natural language disambiguation
Abstract—Natural language understanding involves the simultaneous consideration of a large number of different sources of information. Traditional methods employed in language an...
Samuel W. K. Chan, James Franklin
AMAST
2004
Springer
15 years 3 months ago
Formal JVM Code Analysis in JavaFAN
JavaFAN uses a Maude rewriting logic specification of the JVM semantics as the basis of a software analysis tool with competitive performance. It supports formal analysis of concu...
Azadeh Farzan, José Meseguer, Grigore Rosu
FLAIRS
2006
14 years 11 months ago
Genetic Programming: Analysis of Optimal Mutation Rates in a Problem with Varying Difficulty
In this paper we test whether a correlation exists between the optimal mutation rate and problem difficulty. We find that the range of optimal mutation rates is inversely proporti...
Alan Piszcz, Terence Soule
113
Voted
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 9 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
15 years 2 months ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...