Sciweavers

437 search results - page 34 / 88
» Automatic Generation of Implied Constraints
Sort
View
SCP
2000
119views more  SCP 2000»
13 years 8 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen
AIPS
2009
13 years 9 months ago
Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints
Recently, Helmert and Geffner proposed the context-enhanced additive heuristic, where fact costs are evaluated relative to context states that arise from achieving first a pivot c...
Dunbo Cai, Jörg Hoffmann, Malte Helmert
ICDE
2007
IEEE
125views Database» more  ICDE 2007»
14 years 9 months ago
Ontology-Based Constraint Recognition for Free-Form Service Requests
Automatic recognition and formalization of constraints from free-form service requests is a challenging problem. Its resolution would go a long way toward allowing users to make r...
Muhammed Al-Muhammed, David W. Embley
EKAW
2006
Springer
14 years 4 days ago
Capturing Quantified Constraints in FOL, Through Interaction with a Relationship Graph
As new semantic web standards evolve to allow quantified rules in FOL, we need new ways to capture them from end users. We show how to do this against a graphic view of entities an...
Peter M. D. Gray, Graham J. L. Kemp
ECAI
2008
Springer
13 years 10 months ago
The Impact of Constraint Programming
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
Pascal Van Hentenryck