1677 search results - page 47 / 336 » On the Completeness of Quantum Computation Models |
110
click to vote
GECCO
2008
Springer
15 years 2 months ago
2008
Springer
In this paper, the Quantum-inspired Genetic Algorithms with the population of a single individual are formalized by a Markov chain model using a single and the stored best individ...
109
click to vote
APSCC
2008
IEEE
15 years 8 months ago
2008
IEEE
—This paper examines the problem of predicting job runtimes by exploiting the properties of parameter sweeps. A new parameter sweep prediction framework GIPSy (Grid Information P...
121
click to vote
LREC
2010
15 years 2 months ago
2010
We present Witchcraft, an open-source framework for the evaluation of prediction models for spoken dialogue systems based on interaction logs and audio recordings. The use of Witc...
IANDC
2010
14 years 12 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
117
click to vote
CIE
2005
Springer
15 years 7 months ago
2005
Springer
We argue that there is currently no satisfactory general framework for comparing the extensional computational power of arbitrary computational models operating over arbitrary doma...