2767 search results - page 281 / 554 » Universal Exponentiation Algorithm |
114
Voted
PAKDD
2004
ACM
15 years 8 months ago
2004
ACM
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
139
Voted
SIGECOM
2003
ACM
15 years 8 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
103
Voted
ICLP
2003
Springer
15 years 8 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
104
Voted
RTSS
2002
IEEE
15 years 7 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
115
click to vote
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...