10182 search results - page 1664 / 2037 » Case Studies |
185
click to vote
ICLP
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
193
click to vote
ISAAC
2004
Springer
16 years 8 days ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
173
click to vote
POLICY
2004
Springer
16 years 7 days ago
2004
Springer
We study the specification of access control policy in large-scale distributed systems. Our work on real-world policies has shown that standard policy idioms such as role hierarc...
203
click to vote
PPDP
2004
Springer
16 years 7 days ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
176
click to vote
PPSN
2004
Springer
16 years 7 days ago
2004
Springer
In Multi-Agent learning, agents must learn to select actions that maximize their utility given the action choices of the other agents. Cooperative Coevolution offers a way to evol...