Sciweavers

169 search results - page 15 / 34
» The Tree of Hubs Location Problem
Sort
View
SIGMOD
2006
ACM
107views Database» more  SIGMOD 2006»
16 years 2 months ago
Relaxed space bounding for moving objects: a case for the buddy tree
Rapid advancements in positioning systems and wireless communications enable accurate tracking of continuously moving objects. This development poses new challenges to database te...
Shuqiao Guo, Zhiyong Huang, H. V. Jagadish, Beng C...
IPPS
2007
IEEE
15 years 8 months ago
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
Hailiang Mei, Pravin Pawar, Ing Widya
ASPDAC
2008
ACM
104views Hardware» more  ASPDAC 2008»
15 years 3 months ago
Low power clock buffer planning methodology in F-D placement for large scale circuit design
Traditionally, clock network layout is performed after cell placement. Such methodology is facing a serious problem in nanometer IC designs where people tend to use huge clock buff...
Yanfeng Wang, Qiang Zhou, Yici Cai, Jiang Hu, Xian...
115
Voted
COREGRID
2007
Springer
15 years 8 months ago
Optimal Closest Policy with Qos and Bandwidth Constraints
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
Veronika Rehn-Sonigo
LATIN
2004
Springer
15 years 7 months ago
Cost-Optimal Trees for Ray Shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applicat...
Hervé Brönnimann, Marc Glisse