808 search results - page 41 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
ENTCS
2008
14 years 9 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
SECURWARE
2008
IEEE
15 years 4 months ago
2008
IEEE
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...
SBACPAD
2003
IEEE
15 years 2 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
PPSN
1998
Springer
15 years 1 months ago
1998
Springer
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
ECSQARU
2009
Springer
14 years 7 months ago
2009
Springer
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...