Sciweavers

7092 search results - page 236 / 1419
» Parallelizing constraint programs
Sort
View
IPPS
2003
IEEE
15 years 5 months ago
Global Communication Optimization for Tensor Contraction Expressions under Memory Constraints
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...
Daniel Cociorva, Xiaoyang Gao, Sandhya Krishnan, G...
122
Voted
ICDCS
2000
IEEE
15 years 5 months ago
The Effect of Nogood Learning in Distributed Constraint Satisfaction
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
Makoto Yokoo, Katsutoshi Hirayama
CPAIOR
2009
Springer
15 years 7 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou
94
Voted
IPPS
1998
IEEE
15 years 4 months ago
Synchronizing Operations on Multiple Objects
Parallel programming on distributed memory systems is one of the most challenging research areas in parallel computingtoday. Objectbased parallel programming languages are an impor...
Tim Rühl, Henri E. Bal
89
Voted
AAAI
2006
15 years 2 months ago
Acquiring Constraint Networks Using a SAT-based Version Space Algorithm
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
Christian Bessière, Remi Coletta, Fré...