3422 search results - page 154 / 685 » Random Subset Optimization |
140
Voted
EOR
2010
15 years 2 months ago
2010
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
162
click to vote
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
In this paper, we design a novel MRF framework which is called Non-Local Range Markov Random Field (NLRMRF). The local spatial range of clique in traditional MRF is extended to th...
135
Voted
EOR
2010
15 years 5 months ago
2010
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
164
click to vote
ICIP
2003
IEEE
16 years 6 months ago
2003
IEEE
A new probabilistic image segmentation model based on hypothesis testing and Gibbs Random Fields is introduced. First, a probabilistic difference measure derived from a set of hyp...
146
click to vote
WSCG
2004
15 years 6 months ago
2004
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...