1677 search results - page 62 / 336 » On the Completeness of Quantum Computation Models |
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
159
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Turing complete Genetic Programming (GP) models introduce the concept of internal state, and therefore have the capacity for identifying interesting temporal properties. Surprisin...
PPAM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. In our work we are developing a complete agent-based ecommerce system. Thus far we have been focusing on interactions between clients and shops (C2B relationships). In th...
COCO
2008
Springer
15 years 3 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
111
click to vote
CEC
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract-- Recently, the research on quantum-inspired evolutionary algorithms (QEA) has attracted some attention in the area of evolutionary computation. QEA use a probabilistic re...