Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

IAT
2008
IEEE

favoriteEmaildiscussreport

107views Intelligent Agents» more IAT 2008»

Quantum Service Selection

13 years 11 months ago

Quantum Service Selection

Download www-ags.dfki.uni-sb.de

Quantum service selection facilitates matchmaking of Web services and greatly beneﬁts from quantum memory exponential in the number of its qubits as well as from computational speedup by an order of magnitude. Key idea of this work is the combination of Trugenberger’s algorithms for associative quantum memories and the relaxation of semantic matchmaking to syntactical matchmaking within a graph space equipped with Hamming distance as its metric.

Matthias Klusch, René Schubotz

Real-time Traffic

Associative Quantum Memories | IAT 2008 | Intelligent Agent | Selection Facilitates Matchmaking | Syntactical Matchmaking |

claim paper

Related Content

» Extending scientific computing system with structural quantum programming capabilities

» Comparison of Selection Strategies for Evolutionary Quantum Circuit Design

» Automated Planning Using Quantum Computation

» A proportionate fair scheduling rule with good worstcase performance

» A greedy algorithm for the identification of quantum systems

» Adaptive Application Composition in Quantum Chemistry

» A Probabilistic Graphical Model of Quantum Systems

» Quantum Genetic Optimization

» QUANTUM A FunctionBased Question Answering System

Post Info
More Details (n/a)

Added	29 May 2010
Updated	29 May 2010
Type	Conference
Year	2008
Where	IAT
Authors	Matthias Klusch, René Schubotz

Comments (0)