9842 search results - page 424 / 1969 » The Complexity of the Matching-Cut Problem |
130
click to vote
DLOG
2007
15 years 7 months ago
2007
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
126
click to vote
FLAIRS
2001
15 years 6 months ago
2001
Mixed-initiative learning integrates complementary human and automated reasoning, taking advantage of their respective reasoning styles and computational strengths in order to sol...
134
click to vote
NIPS
2003
15 years 6 months ago
2003
Approximate linear programming (ALP) has emerged recently as one of the most promising methods for solving complex factored MDPs with finite state spaces. In this work we show th...
172
click to vote
SEC
2000
15 years 6 months ago
2000
: The development of complex access control architectures raises the problem of their management. In this article, we describe an architecture providing packet filters configuratio...
153
click to vote
NIPS
1994
15 years 6 months ago
1994
Reinforcement learning addresses the problem of learning to select actions in order to maximize one's performance inunknownenvironments. Toscale reinforcement learning to com...