4843 search results - page 378 / 969 » The Shortcut Problem - Complexity and Approximation |
167
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we present the use of a previously developed single-objective optimization approach, together with the -constraint method, to provide an approximation of the Pareto ...
134
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
145
click to vote
MP
2006
15 years 4 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
137
Voted
ICIP
2005
IEEE
16 years 6 months ago
2005
IEEE
For video communications over wireless ad hoc networks, multiple paths with limited bandwidth are common. It therefore presents new challenges to the video encoding. In this paper...
106
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...