15033 search results - page 176 / 3007 » Complexity Theory and Algorithms |
132
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...
151
click to vote
TEC
2010
14 years 10 months ago
2010
Abstract--In 1968, Volker Strassen, a young German mathematician, announced a clever algorithm to reduce the asymptotic complexity of n
118
click to vote
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
138
click to vote
RSKT
2009
Springer
15 years 8 months ago
2009
Springer
In rough set theory, the problem of feature selection aims to retain the discriminatory power of original features. Many feature selection algorithms have been proposed, however, q...
163
click to vote
ATAL
2010
Springer
15 years 5 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...