4103 search results - page 395 / 821 » Some results on the Collatz problem |
220
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
231
Voted
EC
2006
15 years 6 months ago
2006
Learning Classifier Systems (LCSs), such as the accuracy-based XCS, evolve distributed problem solutions represented by a population of rules. During evolution, features are speci...
196
click to vote
APPROX
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
173
click to vote
SEMWEB
2007
Springer
16 years 29 days ago
2007
Springer
While lots of research in ontology matching is related to the issue of computing and refining similarity measures, only little attention has been paid to question how to extract t...
153
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Shrinkage is a well known and appealing denoising technique. The use of shrinkage is known to be optimal for Gaussian white noise, provided that the sparsity on the signal's ...