1449 search results - page 232 / 290 » Self-Randomized Exponentiation Algorithms |
145
click to vote
ICLP
2003
Springer
15 years 11 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...
136
click to vote
RTSS
2002
IEEE
15 years 11 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...
164
click to vote
SIGECOM
2010
ACM
15 years 10 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...
159
click to vote
ICFP
1999
ACM
15 years 10 months ago
1999
ACM
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
158
click to vote
ESA
2009
Springer
16 years 17 days ago
2009
Springer
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...