4934 search results - page 256 / 987 » complexity 2008 |
199
click to vote
CI
2005
15 years 6 months ago
2005
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...
152
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we study non-binary regular LDPC cycle codes whose parity check matrix has fixed column weight 2 and fixed row weight d. We prove that the parity check matrix of ...
148
click to vote
ICPADS
2008
IEEE
16 years 1 months ago
2008
IEEE
Peer-to-Peer systems have become a substantial element in computer networking. Distributing the load and splitting complex tasks are only some reasons why many developers have com...
143
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, first, a new method called cl...
148
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...