2957 search results - page 312 / 592 » The Complexity of Polynomial-Time Approximation |
164
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
The optimization of rough set based classification models with respect to parameterized balance between a model's complexity and confidence is discussed. For this purpose, the...
153
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In many complex multi-agent domains it is impractical to compute exact analytic solutions. An alternate means of analysis applies computational tools to derive and analyze empiric...
192
click to vote
IJIT
2004
15 years 8 months ago
2004
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
173
click to vote
NIPS
2004
15 years 8 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...