Sciweavers

273 search results - page 19 / 55
» Generalized darting Monte Carlo
Sort
View
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 10 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
CDC
2009
IEEE
142views Control Systems» more  CDC 2009»
14 years 12 days ago
Optimized rate allocation for state feedback control over noisy channels
Abstract— Optimal rate allocation in a networked control system with highly limited communication resources is instrumental to achieve satisfactory overall performance. In this p...
Lei Bao, Mikael Skoglund, Carlo Fischione, Karl He...
TSP
2008
121views more  TSP 2008»
13 years 7 months ago
Stochastic Analysis of the LMS Algorithm for System Identification With Subspace Inputs
This paper studies the behavior of the low-rank least mean squares (LMS) adaptive algorithm for the general case in which the input transformation may not capture the exact input s...
Neil J. Bershad, José Carlos M. Bermudez, J...
SIGIR
2010
ACM
13 years 6 months ago
On performance of topical opinion retrieval
We investigate the effectiveness of both the standard evaluation measures and the opinion component for topical opinion retrieval. We analyze how relevance is affected by opinio...
Giambattista Amati, Giuseppe Amodeo, Valerio Capoz...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 15 days ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel