2223 search results - page 371 / 445 » Ontological Framework for Approximation |
109
click to vote
FSTTCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Typical applications of evolutionary optimization in static environments involve the approximation of the extrema of functions. For dynamic environments, the interest is not to lo...
104
click to vote
ROBOCUP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
124
Voted
SSD
2005
Springer
15 years 6 months ago
2005
Springer
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
87
Voted
CAAN
2004
Springer
15 years 6 months ago
2004
Springer
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...