117 search results - page 20 / 24 » On Two Allocation Methods for Web Services |
105
Voted
WISE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
85
Voted
BMCBI
2006
14 years 10 months ago
2006
Background: Many dimeric protein complexes bind cooperatively to families of bipartite nucleic acid sequence elements, which consist of pairs of conserved half-site sequences sepa...
170
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Typical web-database systems receive read-only queries, that generate dynamic web pages as a response, and writeonly updates, that keep information up-to-date. Users expect short ...
ISORC
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper proposes a new method for programming and controlling distributed tasks. Applications declare behavior patterns that are used to automatically predict and reserve resou...
WWW
2010
ACM
15 years 3 months ago
2010
ACM
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...