88 search results - page 5 / 18 » Faster constraint solving with subtypes |
ACST
2006
13 years 9 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
ACMSE
2006
ACM
14 years 1 months ago
2006
ACM
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...
CPAIOR
2010
Springer
14 years 15 days ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
MPC
2010
Springer
14 years 14 days ago
2010
Springer
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...
IJCAI
2003
13 years 9 months ago
2003
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...