13987 search results - page 557 / 2798 » The Two Guards Problem |
228
click to vote
APPROX
2004
Springer
16 years 18 days ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
188
click to vote
ICCS
2004
Springer
16 years 17 days ago
2004
Springer
Distributed computing in wide area networks requires special approach to solve the problem of communication between secure areas. Since there is no possibility to establish connect...
185
click to vote
NSPW
2003
ACM
16 years 13 days ago
2003
ACM
The aim of this paper is to provide better support for the development of secure systems. We argue that current development practice suffers from two key problems:
191
click to vote
CAISE
2003
Springer
16 years 13 days ago
2003
Springer
The overall problem addressed in this paper is to improve semantic interoperability in heterogeneous systems. Normally, the semantics of data is carried by ontology (concept model)...
181
click to vote
INDOCRYPT
2003
Springer
16 years 12 days ago
2003
Springer
At INDOCRYPT 2003 Abisha, Thomas, and Subramanian proposed two public key schemes based on word problems in free partially commutative monoids and groups. We show that both propos...