1110 search results - page 2 / 222 » New Approximation Results for Resource Replication Problems |
JCP
2008
13 years 7 months ago
2008
The computer world is experiencing a paradigm shift towards context-aware pervasive computing, where diverse computer devices communicate with each other through different network ...
IPL
2002
13 years 7 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
DAM
2010
13 years 7 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
ACL
2010
13 years 5 months ago
2010
We describe the semi-automatic adaptation of a TimeML annotated corpus from English to Portuguese, a language for which TimeML annotated data was not available yet. In order to va...
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
: Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up: a ten-fold increase in nodes and traffic gives a thousand fold increase ...