Sciweavers

506 search results - page 69 / 102
» Desktop Batch Processing
Sort
View
QUESTA
2000
68views more  QUESTA 2000»
15 years 1 months ago
Ergodicity of the BMAP/PH}/s/s+K retrial queue with PH-retrial times
Define the traffic intensity as the ratio of the arrival rate to the service rate. This paper shows that the BMAP/PH/s/s+K retrial queue with PH-retrial times is ergodic if and onl...
Qi-Ming He, Hui Li, Yiqiang Q. Zhao
IJRR
2002
159views more  IJRR 2002»
15 years 1 months ago
Mapping Partially Observable Features from Multiple Uncertain Vantage Points
This paper presents a technique for mapping partially observable features from multiple uncertain vantage points. The problem of concurrent mapping and localization (CML) is state...
John J. Leonard, Richard J. Rikoski, Paul M. Newma...
DPD
1998
174views more  DPD 1998»
15 years 1 months ago
Consistency Algorithms for Multi-Source Warehouse View Maintenance
A warehouse is a data repository containing integrated information for e cient querying and analysis. Maintaining the consistencyof warehouse data is challenging, especially if the...
Yue Zhuge, Hector Garcia-Molina, Janet L. Wiener
PVLDB
2008
104views more  PVLDB 2008»
15 years 1 months ago
Scalable multi-query optimization for exploratory queries over federated scientific databases
The diversity and large volumes of data processed in the Natural Sciences today has led to a proliferation of highlyspecialized and autonomous scientific databases with inherent a...
Anastasios Kementsietsidis, Frank Neven, Dieter Va...
QUESTA
2008
96views more  QUESTA 2008»
15 years 1 months ago
Reduction of a polling network to a single node
We consider a discrete-time tree network of polling servers where all packets are routed to the same node (called node 0), from which they leave the network. All packets have unit...
Paul Beekhuizen, Dee Denteneer, Jacques Resing