3052 search results - page 26 / 611 » Weakly Distributive Domains |
51
Voted
ECOOPW
1999
Springer
15 years 1 months ago
1999
Springer
BSL
2005
14 years 9 months ago
2005
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—A common vulnerability of wireless networks, in particular, the mobile ad hoc network (MANET), is their susceptibility to node compromise/physical capture attacks since the wire...
AUSDM
2007
Springer
15 years 3 months ago
2007
Springer
In the course of reviewing existing automatic term recognition techniques for applications in ontology learning, we came across four issues which can be improved upon. We proposed...
CONCUR
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. We exploit a notion of interface for Petri nets in order to design a set of net combinators. For such a calculus of nets, we focus on the behavioural congruences arising ...