1647 search results - page 236 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
139
click to vote
TACAS
2007
Springer
15 years 8 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
125
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Memory-bounded techniques have shown great promise in solving complex multi-agent planning problems modeled as DEC-POMDPs. Much of the performance gains can be attributed to pruni...
161
click to vote
CVPR
2005
IEEE
15 years 4 months ago
2005
IEEE
We address the normal reconstruction problem by photometric stereo using a uniform and dense set of photometric images captured at fixed viewpoint. Our method is robust to spurio...
117
click to vote
NIPS
2007
15 years 3 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
142
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...