Sciweavers

1548 search results - page 12 / 310
» Statistical Modelling of CSP Solving Algorithms Performance
Sort
View
CP
2005
Springer
14 years 1 months ago
Robust Constraint Solving Using Multiple Heuristics
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...
DAC
2005
ACM
14 years 8 months ago
An efficient algorithm for statistical minimization of total power under timing yield constraints
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
Murari Mani, Anirudh Devgan, Michael Orshansky
PR
2010
184views more  PR 2010»
13 years 6 months ago
Total variation, adaptive total variation and nonconvex smoothly clipped absolute deviation penalty for denoising blocky images
The total variation-based image denoising model has been generalized and extended in numerous ways, improving its performance in different contexts. We propose a new penalty func...
Aditya Chopra, Heng Lian
ICPP
1993
IEEE
13 years 11 months ago
Solving the Region Growing Problem on the Connection Machine
Abstract { This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach. The algorithm was implemented on the CM-2 and the ...
Nawal Copty, Sanjay Ranka, Geoffrey Fox, Ravi V. S...
AMAI
2000
Springer
13 years 11 months ago
On Solving Boolean Optimization with Satisfiability-Based Algorithms
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
Vasco M. Manquinho, João P. Marques Silva