284 search results - page 46 / 57 » On Some Polyhedra Covering Problems |
147
Voted
SRDS
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
145
Voted
SAT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
113
Voted
UC
2009
Springer
15 years 10 months ago
2009
Springer
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
119
Voted
WG
2005
Springer
15 years 9 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
113
Voted
NSPW
2006
ACM
15 years 9 months ago
2006
ACM
This paper details a true and striking paradigm shift: the use of E-Prime for (at least) user-centered security, organizational/enterprise security policies and informal security ...