900 search results - page 94 / 180 » On Polynomial Time Computation over Unordered Structures |
143
Voted
JACM
2010
15 years 1 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
108
click to vote
TALG
2010
15 years 1 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
145
click to vote
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
152
Voted
AAAI
2012
13 years 5 months ago
2012
Planning under uncertainty is an important and challenging problem in multiagent systems. Multiagent Partially Observable Markov Decision Processes (MPOMDPs) provide a powerful fr...
110
Voted
CHI
2003
ACM
16 years 3 months ago
2003
ACM
In cooperative activity users require information about their cooperative environment. AwarenessMaps provide the members of shared workspaces with an overview of users and shared ...