81 search results - page 6 / 17 » Exploring the search space of quantum programs |
CEC
2003
IEEE
14 years 1 months ago
2003
IEEE
Abstract- The Maximum Homologous Crossover attempts to preserve similar structures from parents by aligning them according to their homology. In this paper, it is successfully test...
ICST
2009
IEEE
14 years 2 months ago
2009
IEEE
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
OOPSLA
1997
Springer
13 years 12 months ago
1997
Springer
Object relationships in modern software systems are becoming increasingly numerous and complex. Programmers who try to find violations of such relationships need new tools that al...
CP
2009
Springer
14 years 2 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...