2957 search results - page 278 / 592 » The Complexity of Polynomial-Time Approximation |
174
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
151
click to vote
SIGECOM
2006
ACM
16 years 19 days ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
185
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...
200
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
197
Voted
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...