Sciweavers

1439 search results - page 96 / 288
» Fast approximation of centrality
Sort
View
ATAL
2006
Springer
15 years 1 months ago
Decentralized planning under uncertainty for teams of communicating agents
Decentralized partially observable Markov decision processes (DEC-POMDPs) form a general framework for planning for groups of cooperating agents that inhabit a stochastic and part...
Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos A....
SEBD
2003
144views Database» more  SEBD 2003»
14 years 11 months ago
Approximate Query Answering on Sensor Network Data Streams
Abstract. Sensor networks represent a non traditional source of information, as readings generated by sensors flow continuously, leading to an infinite stream of data. Traditiona...
Alfredo Cuzzocrea, Filippo Furfaro, Elio Masciari,...
BMCBI
2006
141views more  BMCBI 2006»
14 years 10 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
CAD
2004
Springer
14 years 9 months ago
Control point adjustment for B-spline curve approximation
Pottmann et al. propose an iterative optimization scheme for approximating a target curve with a B-spline curve based on square distance minimization, or SDM. The main advantage o...
Huaiping Yang, Wenping Wang, Jia-Guang Sun
SIGMETRICS
2010
ACM
152views Hardware» more  SIGMETRICS 2010»
14 years 8 months ago
A fluid approximation for large-scale service systems
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
Yunan Liu, Ward Whitt