1391 search results - page 110 / 279 » Complexity Limitations on Quantum Computation |
153
Voted
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
128
Voted
SOCA
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Workflow design, mashup configuration, and composite service formation are examples where the capabilities of multiple simple services combined achieve a complex function...
138
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
242
Voted
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
110
Voted
IWINAC
2007
Springer
15 years 9 months ago
2007
Springer
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...