908 search results - page 124 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
134
Voted
CSCLP
2004
Springer
15 years 9 months ago
2004
Springer
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
137
Voted
DAC
2004
ACM
16 years 4 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
147
Voted
CVBIA
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we present a new framework for image segmentation using probabilistic multinets. We apply this framework to integration of regionbased and contour-based segmentation ...
132
Voted
PATAT
1995
Springer
15 years 7 months ago
1995
Springer
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
150
Voted
EOR
2010
15 years 3 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...