10 search results - page 2 / 2 » A Theoretical and Empirical Study of Search-Based Testing: L... |
AUSAI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper presents a comparative study between a state-ofthe-art clause weighting local search method for satisfiability testing and a variant modified to obtain longe...
KI
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
NK models provide a family of tunably rugged fitness landscapes used in a wide range of evolutionary computation studies. It is well known that the average height of local optima...
ML
2010
ACM
12 years 11 months ago
2010
ACM
Spectral analysis approaches have been actively studied in machine learning and data mining areas, due to their generality, efficiency, and rich theoretical foundations. As a natur...
AISB
1994
Springer
13 years 9 months ago
1994
Springer
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...