Sciweavers

3341 search results - page 571 / 669
» On Bounded Queries and Approximation
Sort
View
TWC
2008
125views more  TWC 2008»
14 years 9 months ago
Cooperative communications with relay-selection: when to cooperate and whom to cooperate with?
Abstract--In this paper, we propose a new cooperative communication protocol, which achieves higher bandwidth efficiency while guaranteeing the same diversity order as that of the ...
Ahmed S. Ibrahim, Ahmed K. Sadek, Weifeng Su, K. J...
JUCS
2007
98views more  JUCS 2007»
14 years 9 months ago
Focus of Attention in Reinforcement Learning
Abstract: Classification-based reinforcement learning (RL) methods have recently been proposed as an alternative to the traditional value-function based methods. These methods use...
Lihong Li, Vadim Bulitko, Russell Greiner
VC
2008
102views more  VC 2008»
14 years 9 months ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...
MANSCI
2007
100views more  MANSCI 2007»
14 years 9 months ago
Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
Companies such as Zara and World Co. have recently implemented novel product development processes and supply chain architectures enabling them to make more product design and ass...
Felipe Caro, Jérémie Gallien
ECCC
2000
158views more  ECCC 2000»
14 years 9 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass