714 search results - page 118 / 143 » Lexicographically-ordered constraint satisfaction problems |
IEEEARES
2007
IEEE
15 years 3 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...
CPC
2006
14 years 9 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
92
Voted
CP
2008
Springer
14 years 11 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
SAC
2009
ACM
15 years 4 months ago
2009
ACM
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
CDC
2009
IEEE
15 years 24 days ago
2009
IEEE
Abstract— A design method is proposed for outputfeedback control of linear systems subject to state and control constraints, additive disturbances and measurement noise. First, n...