4843 search results - page 163 / 969 » The Shortcut Problem - Complexity and Approximation |
161
click to vote
MOR
2007
15 years 2 months ago
2007
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
140
click to vote
SODA
2010
ACM
16 years 18 days ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
105
click to vote
GMP
2006
IEEE
15 years 9 months ago
2006
IEEE
The problem of approximating a given set of data points by splines composed of Pythagorean Hodograph (PH) curves is addressed. In order to solve this highly non-linear problem, we ...
121
click to vote
FSTTCS
2003
Springer
15 years 8 months ago
2003
Springer
Recently, Jain, Mahdian and Saberi [5] had given a FPTAS for the problem of computing a market equilibrium in the Arrow-Debreu setting, when the utilities are linear functions. The...
106
click to vote
COLT
2000
Springer
15 years 7 months ago
2000
Springer
We model reinforcement learning as the problem of learning to control a Partially Observable Markov Decision Process ( ¢¡¤£¦¥§ ), and focus on gradient ascent approache...