Sciweavers

243 search results - page 14 / 49
» Parallel and distributed algorithms for finite constraint sa...
Sort
View
CP
2009
Springer
14 years 8 months ago
Asynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
Redouane Ezzahir, Christian Bessiere, Mohamed Wahb...
CCGRID
2010
IEEE
13 years 8 months ago
Asynchronous Communication Schemes for Finite Difference Methods on Multiple GPUs
Finite difference methods continue to provide an important and parallelisable approach to many numerical simulations problems. Iterative multigrid and multilevel algorithms can co...
Daniel P. Playne, Kenneth A. Hawick
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 7 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
IPPS
1996
IEEE
13 years 11 months ago
An Element-Based Concurrent Partitioner for Unstructured Finite Element Meshes
A concurrent partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The partitioner uses an element-based partitioning st...
Hong Q. Ding, Robert D. Ferraro
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 11 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller