Sciweavers

272 search results - page 34 / 55
» A Game-Theoretic Approach to Constraint Satisfaction
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
14 years 11 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
KI
2002
Springer
14 years 9 months ago
Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
Bernhard Nebel, Alexander Scivos
SARA
2005
Springer
15 years 3 months ago
Approximate Model-Based Diagnosis Using Preference-Based Compilation
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
Gregory M. Provan
WWW
2008
ACM
15 years 10 months ago
Integrating the IAC neural network in ontology mapping
Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. This paper proposes a neural network based approach to search for a globa...
Ming Mao, Yefei Peng, Michael Spring
COLCOM
2007
IEEE
14 years 11 months ago
Maintaining constraints expressed as formulas in collaborative systems
—Constraints allow users to declare relationships among objects and let the constraint systems maintain and satisfy these relationships. Formulas have been adopted to express con...
Kai Lin, David Chen, R. Geoff Dromey, Chengzheng S...