Sciweavers

534 search results - page 79 / 107
» Proving Termination of Rewrite Systems Using Bounds
Sort
View
GLOBECOM
2009
IEEE
13 years 6 months ago
Optimizing Training-Based Transmission for Correlated MIMO Systems with Hybrid Feedback
Abstract--In this paper, we consider multiple-input multipleoutput (MIMO) communication systems with combined channel covariance feedback (CCF) and channel gain feedback (CGF), her...
Xiangyun Zhou, Tharaka A. Lamahewa, Parastoo Sadeg...
ARITH
2003
IEEE
14 years 2 months ago
SRT Division Algorithms as Dynamical Systems
SRT division, as it was discovered in the late 1950s represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division ...
Mark McCann, Nicholas Pippenger
ML
2007
ACM
104views Machine Learning» more  ML 2007»
13 years 8 months ago
A general criterion and an algorithmic framework for learning in multi-agent systems
We offer a new formal criterion for agent-centric learning in multi-agent systems, that is, learning that maximizes one’s rewards in the presence of other agents who might also...
Rob Powers, Yoav Shoham, Thuc Vu
TCS
2008
13 years 8 months ago
Nondeterministic polynomial time factoring in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...
Yuriy Brun
COCOON
2008
Springer
13 years 10 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi