939 search results - page 10 / 188 » Semantic Abstraction and Quantum Computation |
TEC
2008
14 years 9 months ago
2008
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
MKM
2009
Springer
15 years 4 months ago
2009
Springer
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly reduces the complexity of many calculations [4,10], manu...
IV
2005
IEEE
15 years 3 months ago
2005
IEEE
We have developed a visual syntax for representing concepts that are contingent on temporal properties (timedependent semantics). A within-group (N=24) experiment was conducted to...
COMMA
2008
14 years 11 months ago
2008
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...