2957 search results - page 249 / 592 » The Complexity of Polynomial-Time Approximation |
189
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
254
click to vote
VLDB
2001
ACM
16 years 6 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
161
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
214
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
164
click to vote
ICDM
2007
IEEE
16 years 29 days ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...