Sciweavers

22193 search results - page 205 / 4439
» Multiple Restricted Multiplication
Sort
View
ICGI
2010
Springer
15 years 7 months ago
Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
Ryo Yoshinaka
ICML
2010
IEEE
15 years 7 months ago
Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis
We introduce new, efficient algorithms for value iteration with multiple reward functions and continuous state. We also give an algorithm for finding the set of all nondominated a...
Daniel J. Lizotte, Michael H. Bowling, Susan A. Mu...
CORR
2008
Springer
106views Education» more  CORR 2008»
15 years 6 months ago
Topological Observations on Multiplicative Additive Linear Logic
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a "topological" game for Multiplicative Additive Linear Logic ...
André Hirschowitz, Michel Hirschowitz, Tom ...
CORR
2007
Springer
112views Education» more  CORR 2007»
15 years 6 months ago
Precoding in Multiple-Antenna Broadcast Systems with a Probabilistic Viewpoint
—In this paper, we investigate the minimum average transmit energy that can be obtained in multiple antenna broadcast systems with channel inversion technique. The achievable gai...
Amin Mobasher, Amir K. Khandani
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 6 months ago
Finding low-weight polynomial multiples using discrete logarithm
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
Frédéric Didier, Yann Laigle-Chapuy