1483 search results - page 160 / 297 » Geometric constraint satisfaction using optimization methods |
105
click to vote
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
In this paper, we present a new area-based method for visual correspondence search that focuses on the dissimilarity computation. Local and area-based matching methods generally m...
NOMS
2008
IEEE
15 years 7 months ago
2008
IEEE
—In this paper∗ , we devise a novel method for bottleneck analysis of UDP networks based on the concept of network utility maximization. To determine the losses on the links in...
100
click to vote
CP
1995
Springer
15 years 4 months ago
1995
Springer
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...
120
click to vote
IJCAI
2001
15 years 2 months ago
2001
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
110
click to vote
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...