Sciweavers

1968 search results - page 45 / 394
» The Complexity of Valued Constraint Models
Sort
View
FOCS
1999
IEEE
15 years 9 months ago
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
Uwe Schöning
121
Voted
ACL
2006
15 years 6 months ago
Empirical Lower Bounds on the Complexity of Translational Equivalence
This paper describes a study of the patterns of translational equivalence exhibited by a variety of bitexts. The study found that the complexity of these patterns in every bitext ...
Benjamin Wellington, Sonjia Waxmonsky, I. Dan Mela...
ICTAI
1993
IEEE
15 years 9 months ago
Integrating Constraints, Composite Objects and Tasks in a Knowledge Representation System
Tropes, an object-based knowledge representation system, has been added three important intertwined features: constraints, composite objects and tasks. Constraints provide a decla...
Jérôme Gensel, Pierre Girard, Olivier...
146
Voted
UML
1998
Springer
15 years 9 months ago
Reflections on the Object Constraint Language
The object Constraint Language (OCL), which forms part of the UML set of modelling notations, is a precise, textual language for expressing constraints that cannot be shown diagram...
Ali Hamie, Franco Civello, John Howse, Stuart Kent...
165
Voted
EWCBR
2004
Springer
15 years 10 months ago
Explanation Service for Complex CBR Applications
Case-based Reasoning (CBR) is a mature technology for building knowledge-based systems that are capable to produce useful results even if no answer matches the query exactly. Often...
Rainer Maximini, Andrea Freßmann, Martin Sch...