2661 search results - page 226 / 533 » Quantum Complexity Classes |
151
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
138
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Decentralized partially observable MDPs (DEC-POMDPs) provide a rich framework for modeling decision making by a team of agents. Despite rapid progress in this area, the limited sc...
140
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
132
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— Differential Unitary Space-Time Block codes (STBCs) offer a means to communicate on the Multiple Input Multiple Output (MIMO) channel without the need for channel knowledge at ...
147
Voted
APN
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered infinite domains and in which whole-place operations such as resets an...