Sciweavers

942 search results - page 55 / 189
» Distance Constraint Satisfaction Problems
Sort
View
KCAP
2005
ACM
14 years 3 months ago
Knowledge base reuse through constraint relaxation
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
Tomas Eric Nordlander, Derek H. Sleeman, Ken N. Br...
ACL
1990
13 years 11 months ago
Structural Disambiguation with Constraint Propagation
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
Hiroshi Maruyama
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 10 months ago
Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
Martin C. Cooper, Stanislav Zivný
SAC
2010
ACM
14 years 4 months ago
Relational consistency by constraint filtering
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...
IFIP
2004
Springer
14 years 3 months ago
Reasoning about Secure Interoperation Using Soft Constraints
Abstract The security of a network configuration is based not just on the security of its individual components and their direct interconnections, but also on the potential for sy...
Stefano Bistarelli, Simon N. Foley, Barry O'Sulliv...