939 search results - page 10 / 188 » Semantic Abstraction and Quantum Computation |
165
click to vote
TEC
2008
15 years 5 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...
166
click to vote
MKM
2009
Springer
16 years 17 days 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...
143
click to vote
IV
2005
IEEE
15 years 11 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...
173
click to vote
STACS
2010
Springer
16 years 1 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...