Sciweavers

3708 search results - page 542 / 742
» Approximating Betweenness Centrality
Sort
View
WIDM
2006
ACM
16 years 16 days ago
SRI: exploiting semantic information for effective query routing in a PDMS
The huge amount of data available from Internet information sources has focused much attention on the sharing of distributed information through Peer Data Management Systems (PDMS...
Federica Mandreoli, Riccardo Martoglia, Simona Sas...
IWLCS
2005
Springer
16 years 2 days ago
Counter Example for Q-Bucket-Brigade Under Prediction Problem
Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of ...
Atsushi Wada, Keiki Takadama, Katsunori Shimohara
VLDB
2005
ACM
196views Database» more  VLDB 2005»
16 years 1 days ago
Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling
Emerging data stream management systems approach the challenge of massive data distributions which arrive at high speeds while there is only small storage by summarizing and minin...
Graham Cormode, S. Muthukrishnan, Irina Rozenbaum
VMCAI
2005
Springer
16 years 1 days ago
On the Complexity of Error Explanation
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
Nirman Kumar, Viraj Kumar, Mahesh Viswanathan
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
15 years 12 months ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...