Sciweavers

1589 search results - page 154 / 318
» Constraints with Variables' Annotations
Sort
View
CP
2007
Springer
14 years 4 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
ACMSE
2006
ACM
14 years 4 months ago
Type inference and informative error reporting for secure information flow
If we classify the variables of a program into various security levels, then a secure information flow analysis aims to verify statically that information in the program can flo...
Zhenyue Deng, Geoffrey Smith
AUSAI
2004
Springer
14 years 3 months ago
Set Bounds and (Split) Set Domain Propagation Using ROBDDs
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
Peter Hawkins, Vitaly Lagoon, Peter J. Stuckey
ECAI
2004
Springer
14 years 1 months ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
SDM
2010
SIAM
256views Data Mining» more  SDM 2010»
13 years 11 months ago
The Application of Statistical Relational Learning to a Database of Criminal and Terrorist Activity
We apply statistical relational learning to a database of criminal and terrorist activity to predict attributes and event outcomes. The database stems from a collection of news ar...
B. Delaney, Andrew S. Fast, W. M. Campbell, C. J. ...