1677 search results - page 145 / 336 » On the Completeness of Quantum Computation Models |
156
click to vote
PACT
1997
Springer
15 years 10 months ago
1997
Springer
This paper argues for an alternative way of designing coordination models for parallel and distributed environments based on a complete symmetry between and decoupling of producers...
151
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
The Stack algorithm, which is a best-first search algorithm widely used in speech recognition, is modified for application to the problem of recognizing machine printed text in th...
166
click to vote
FORMATS
2004
Springer
15 years 12 months ago
2004
Springer
We propose an effective and complete method for verifying safety and properties of timed systems, which is based on predicate abstraction for g finite abstractions of timed autom...
187
click to vote
ICLP
2001
Springer
15 years 11 months ago
2001
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...
210
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...