51 search results - page 8 / 11 » Local search algorithms on the Stable Marriage Problem: Expe... |
ISDA
2009
IEEE
14 years 2 months ago
2009
IEEE
Recent studies [13, 18] have shown that clearing schemes are efficient multi-modal optimization methods. They efficiently reduce genetic drift which is the direct reason for prema...
IJCAI
2007
13 years 9 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
ICCV
2009
IEEE
15 years 16 days ago
2009
IEEE
We study the problem of estimating the epipolar geometry
from apparent contours of smooth curved surfaces
with affine camera models. Since apparent contours are
viewpoint depend...
PPAM
2007
Springer
14 years 1 months ago
2007
Springer
This work concentrates on the design of a system intended for study of advanced scheduling techniques for planning various types of jobs in a Grid environment. The solution is able...
TEC
2010
13 years 2 months ago
2010
In the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but als...