Sciweavers

1510 search results - page 279 / 302
» Upper Probabilities and Additivity
Sort
View
SIGMOD
2010
ACM
189views Database» more  SIGMOD 2010»
15 years 2 months ago
Recsplorer: recommendation algorithms based on precedence mining
We study recommendations in applications where there are temporal patterns in the way items are consumed or watched. For example, a student who has taken the Advanced Algorithms c...
Aditya G. Parameswaran, Georgia Koutrika, Benjamin...
87
Voted
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 2 months 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
ICSE
2010
IEEE-ACM
15 years 2 months ago
Characterizing and predicting which bugs get fixed: an empirical study of Microsoft Windows
We performed an empirical study to characterize factors that affect which bugs get fixed in Windows Vista and Windows 7, focusing on factors related to bug report edits and relat...
Philip J. Guo, Thomas Zimmermann, Nachiappan Nagap...
CDC
2009
IEEE
176views Control Systems» more  CDC 2009»
15 years 2 months ago
Controllability of the rotation of a quantum planar molecule
Abstract— We consider the simplest model for controlling the rotation of a molecule by the action of an electric field, namely a quantum planar pendulum. This problem consists i...
Ugo V. Boscain, Thomas Chambrion, Paolo Mason, Mar...
BTW
2009
Springer
132views Database» more  BTW 2009»
15 years 2 months ago
A Bayesian Approach to Estimating the Selectivity of Conjunctive Predicates
: Cost-based optimizers in relational databases make use of data statistics to estimate intermediate result cardinalities. Those cardinalities are needed to estimate access plan co...
M. Heimel, Volker Markl, Keshava Murthy