Sciweavers

1414 search results - page 146 / 283
» Cover Time and Broadcast Time
Sort
View
JASIS
2007
121views more  JASIS 2007»
14 years 10 months ago
Can citation analysis of Web publications better detect research fronts?
We present evidence that, in some research fields, research published in journals and reported on the Web may collectively represent different evolutionary stages of the field wit...
Dangzhi Zhao, Andreas Strotmann
MST
2000
57views more  MST 2000»
14 years 9 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
DEXA
2009
Springer
153views Database» more  DEXA 2009»
15 years 1 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
MP
1998
105views more  MP 1998»
14 years 9 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
15 years 11 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...