75 search results - page 11 / 15 » Search Procedures and Parallelism in Constraint Programming |
SAT
2005
Springer
14 years 1 months ago
2005
Springer
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algo...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...
ESEM
2008
ACM
13 years 9 months ago
2008
ACM
Building cost estimation models is often considered a search problem in which the solver should return an optimal solution satisfying an objective function. This solution also nee...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Reliability is a critical issue in many multi-organizational distributed applications, be they web services, financial protocols, scientific computing infrastructure, and software ...