1998 search results - page 212 / 400 » Complexity of the Cover Polynomial |
190
click to vote
NMR
2004
Springer
15 years 12 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
204
click to vote
SIGECOM
2003
ACM
15 years 12 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
175
click to vote
ASP
2003
Springer
15 years 11 months ago
2003
Springer
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in a...
143
click to vote
RTSS
2002
IEEE
15 years 11 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
178
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
Algebraic invariants extracted from coefficients of implicit polynomials (IPs) have been attractive because of its convenience for solving the recognition problem in computer visio...