900 search results - page 36 / 180 » On Polynomial Time Computation over Unordered Structures |
124
click to vote
SC
1995
ACM
15 years 6 months ago
1995
ACM
We evaluate the impact of a gigabit network on the implementation of a distributed chemical process optimization application. The optimization problem is formulated as a stochasti...
124
click to vote
SIGECOM
2004
ACM
15 years 8 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
103
Voted
DCC
2008
IEEE
16 years 2 months ago
2008
IEEE
There are two main classes of decoding algorithms for "compressed sensing," those which run time time polynomial in the signal length and those which use sublinear resou...
136
Voted
CONCUR
2010
Springer
15 years 4 months ago
2010
Springer
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
137
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...