900 search results - page 68 / 180 » On Polynomial Time Computation over Unordered Structures |
PODC
1990
ACM
14 years 27 days ago
1990
ACM
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...
CCS
2009
ACM
14 years 3 months ago
2009
ACM
Peer-to-peer approaches to anonymous communication promise to eliminate the scalability concerns and central vulnerability points of current networks such as Tor. However, the P2P...
DSN
2002
IEEE
14 years 1 months ago
2002
IEEE
We present ideas on how to structure software systems for high availability by considering MTTR/MTTF characteristics of components in addition to the traditional criteria, such as...
WIA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
ICCS
1998
Springer
14 years 1 months ago
1998
Springer
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics),...