871 search results - page 159 / 175 » The vertex-cover polynomial of a graph |
149
click to vote
ICICS
2005
Springer
15 years 11 months ago
2005
Springer
Modeling and analysis of information system vulnerabilities helps us to predict possible attacks to networks using the network configuration and vulnerabilities information. As a f...
152
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
156
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
211
click to vote
LICS
2000
IEEE
15 years 10 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
173
click to vote
AGP
1994
IEEE
15 years 10 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...