3894 search results - page 170 / 779 » Approximation Algorithms for Biclustering Problems |
176
click to vote
HEURISTICS
2006
15 years 6 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
226
click to vote
PEPM
1995
ACM
15 years 10 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
187
click to vote
SODA
2010
ACM
16 years 3 months 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...
167
click to vote
FSTTCS
2003
Springer
15 years 11 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...
139
click to vote
COLT
2000
Springer
15 years 10 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...