Sciweavers

3090 search results - page 242 / 618
» On Testing Answer-Set Programs
Sort
View
EUROGP
2006
Springer
112views Optimization» more  EUROGP 2006»
15 years 10 months ago
The Halting Probability in Von Neumann Architectures
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
William B. Langdon, Riccardo Poli
CORR
2006
Springer
149views Education» more  CORR 2006»
15 years 6 months ago
Synonym search in Wikipedia: Synarcher
The program Synarcher for synonym (and related terms) search in the text corpus of special structure (Wikipedia) was developed. The results of the search are presented in the form...
Andrew Krizhanovsky
IJFCS
2008
81views more  IJFCS 2008»
15 years 6 months ago
Reachability Analysis in Verification via Supercompilation
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...
Alexei Lisitsa, Andrei P. Nemytykh
ICSE
2008
IEEE-ACM
16 years 6 months ago
On the automation of fixing software bugs
Software Testing can take up to half of the resources of the development of new software. Although there has been a lot of work on automating the testing phase, fixing a bug after...
Andrea Arcuri
CPHYSICS
2006
127views more  CPHYSICS 2006»
15 years 6 months ago
GenAnneal: Genetically modified Simulated Annealing
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
Ioannis G. Tsoulos, Isaac E. Lagaris