Sciweavers

14649 search results - page 234 / 2930
» Principles of problem solving
Sort
View
AI
2006
Springer
15 years 6 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
AICOM
2004
80views more  AICOM 2004»
15 years 6 months ago
A Generic, Collaborative Framework for Interval Constraint Solving
The paper abstracts the contents of a PhD dissertation entitled A Generic, Collaborative Framework for Interval Constraint Solving which has been recently defended. This thesis pre...
Antonio J. Fernández
MOC
1998
64views more  MOC 1998»
15 years 6 months ago
Analysis of non-overlapping domain decomposition algorithms with inexact solves
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
James H. Bramble, Joseph E. Pasciak, Apostol T. Va...
CP
2010
Springer
15 years 4 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex
DLT
2010
15 years 8 months ago
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
Abstract. It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in...
Niko Haubold, Markus Lohrey, Christian Mathissen