1677 search results - page 198 / 336 » On the Completeness of Quantum Computation Models |
186
click to vote
ATAL
2005
Springer
16 years 1 days ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
169
click to vote
CONCUR
2003
Springer
15 years 11 months ago
2003
Springer
Patterns of Compositional Reasoning Nina Amla1 , E. Allen Emerson2 , Kedar Namjoshi3 , and Richard Trefler4 1 Cadence Design Systems 2 Univ. of Texas at Austin 3 Bell Labs, Lucent...
190
click to vote
ARCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Certificate-based authentication of parties provides a powerful means for verifying claimed identities, since communicating partners do not have to exchange secrets in ad...
167
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
126
click to vote
COR
2010
15 years 6 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...