Sciweavers

1138 search results - page 73 / 228
» Parallel Implementation of Constraint Solving
Sort
View
IPPS
1997
IEEE
13 years 12 months ago
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
Yuji Shinano, Kenichi Harada, Ryuichi Hirabayashi
PRL
2006
115views more  PRL 2006»
13 years 7 months ago
A hybrid parallel projection approach to object-based image restoration
Approaches analyzing local characteristics of an image prevail in image restoration. However, they are less effective in cases of restoring images degraded by large size point spr...
Xin Fan, Hua Huang, Dequn Liang, Chun Qi
DSN
2007
IEEE
14 years 2 months ago
Measuring Availability in Optimistic Partition-Tolerant Systems with Data Constraints
Replicated systems that run over partitionable environments, can exhibit increased availability if isolated partitions are allowed to optimistically continue their execution indep...
Mikael Asplund, Simin Nadjm-Tehrani, Stefan Beyer,...
NPAR
2010
ACM
14 years 25 days ago
Diffusion constraints for vector graphics
The formulation of Diffusion Curves [Orzan et al. 2008] allows for the flexible creation of vector graphics images from a set of curves and colors: a diffusion process fills out...
Hedlena Bezerra, Elmar Eisemann, Doug DeCarlo, Jo&...
TAP
2008
Springer
102views Hardware» more  TAP 2008»
13 years 7 months ago
A Logic-Based Approach to Combinatorial Testing with Constraints
Abstract. Usage of combinatorial testing is wide spreading as an effective technique to reveal unintended feature interaction inside a given system. To this aim, test cases are con...
Andrea Calvagna, Angelo Gargantini