8824 search results - page 317 / 1765 » On the Complexity of Real Functions |
198
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
222
Voted
INFOCOM
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
219
click to vote
AIPRF
2008
15 years 8 months ago
2008
A fitness function is needed for a Genetic Algorithm (GA) to work, and it appears natural that the combination of objectives and constraints into a single scalar function using ar...
190
Voted
ICMLA
2008
15 years 8 months ago
2008
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
170
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...