Sciweavers

1689 search results - page 300 / 338
» Approximate zero-variance simulation
Sort
View
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
15 years 1 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
ICML
1994
IEEE
15 years 1 months ago
A Modular Q-Learning Architecture for Manipulator Task Decomposition
Compositional Q-Learning (CQ-L) (Singh 1992) is a modular approach to learning to performcomposite tasks made up of several elemental tasks by reinforcement learning. Skills acqui...
Chen K. Tham, Richard W. Prager
CSE
2009
IEEE
15 years 1 months ago
Energy Consumption of Residential and Professional Switches
Abstract—Precise evaluation of network appliance energy consumption is necessary to accurately model or simulate the power consumption of distributed systems. In this paper we ev...
Helmut Hlavacs, Georges Da Costa, Jean-Marc Pierso...
IPAS
2007
15 years 4 days ago
Color filter array interpolation based on spatial adaptivity
Conventional approach in single-chip digital cameras is a use of color lter arrays (CFA) in order to sample di erent spectral components. Demosaicing algorithms interpolate these ...
Dmitriy Paliy, Radu Ciprian Bilcu, Vladimir Katkov...
AAAI
2008
15 years 1 days ago
A General Framework for Generating Multivariate Explanations in Bayesian Networks
Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target...
Changhe Yuan, Tsai-Ching Lu