465 search results - page 90 / 93 » On the Hardness of Range Assignment Problems |
148
click to vote
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Many modern enterprises are collecting data at the most detailed level possible, creating data repositories ranging from terabytes to petabytes in size. The ability to apply sophi...
WOMPAT
2001
Springer
15 years 1 months ago
2001
Springer
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although cl...
ICDAR
2007
IEEE
15 years 1 months ago
2007
IEEE
Unveiled in late 2004, Google Book Search is an ambitious program to make all the world's books discoverable online. The sheer scale of the problem brings a number of unique ...
KR
2000
Springer
15 years 1 months ago
2000
Springer
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
FAST
2010
14 years 11 months ago
2010
Live migration of virtual hard disks between storage arrays has long been possible. However, there is a dearth of online tools to perform automated virtual disk placement and IO l...