Sciweavers

613 search results - page 110 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
SEMWEB
2004
Springer
14 years 2 months ago
Query Answering for OWL-DL with Rules
Both OWL-DL and function-free Horn rules3 are decidable logics with interesting, yet orthogonal expressive power: from the rules perspective, OWL-DL is restricted to tree-like rule...
Boris Motik, Ulrike Sattler, Rudi Studer
IMC
2003
ACM
14 years 1 months ago
Virtual landmarks for the internet
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
Liying Tang, Mark Crovella
SPAA
2003
ACM
14 years 1 months ago
Cycle stealing under immediate dispatch task assignment
We consider the practical problem of task assignment in a server farm, where each arriving job is immediately dispatched to a server in the farm. We look at the benefit of cycle ...
Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, ...
HIPC
2009
Springer
13 years 6 months ago
Optimizing the use of GPU memory in applications with large data sets
Abstract--With General Purpose programmable GPUs becoming more and more popular, automated tools are needed to bridge the gap between achievable performance from highly parallel ar...
Nadathur Satish, Narayanan Sundaram, Kurt Keutzer
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
14 years 28 days ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim