717 search results - page 87 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
IEEEARES
2007
IEEE
15 years 4 months ago
2007
IEEE
The most important part of a firewall configuration process is the implementation of a security policy by a security administrator. However, this security policy is not designed b...
HEURISTICS
2008
14 years 8 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
FLAIRS
2004
14 years 11 months ago
2004
Constraint satisfaction technology emerged from AI research. Its practical success is based on integration of sophisticated search with consistency techniques reducing the search ...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...