1404 search results - page 25 / 281 » Complexity of admissible rules |
ICMCS
2000
IEEE
14 years 2 months ago
2000
IEEE
The goal of QoS routing is to find a loopless path through a network that can satisfy a given set of constraints on parameters such as bandwidth, delay and cost. QoS routing algo...
AAAI
1990
13 years 11 months ago
1990
Troubleshooting problems in real manufacturing environments impose constraints on admissible solutions that make the computational solutions offered by "troubleshooting from ...
PVLDB
2010
13 years 8 months ago
2010
The ability to decompose a complex, long-running query into simpler queries that produce the same result is useful for many scenarios, such as admission control, resource manageme...
VLDB
1998
ACM
14 years 2 months ago
1998
ACM
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
IANDC
2010
13 years 9 months ago
2010
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...