Sciweavers

1224 search results - page 24 / 245
» Theory decision by decomposition
Sort
View
ATAL
2009
Springer
14 years 4 months ago
Solving multiagent assignment Markov decision processes
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
Scott Proper, Prasad Tadepalli
GLOBECOM
2006
IEEE
14 years 3 months ago
Optimized Transmission for Upstream Vectored DSL Systems Using Zero-Forcing Generalized Decision-Feedback Equalizers
— In upstream vectored DSL transmission, the far-end crosstalk (FEXT) can be completely cancelled by using zeroforcing generalized decision-feedback equalizers (ZF-GDFE). When th...
Chiang-Yu Chen, Kibeom Seong, Rui Zhang, John M. C...
DAM
2008
111views more  DAM 2008»
13 years 10 months ago
Sums of squares based approximation algorithms for MAX-SAT
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
Hans van Maaren, Linda van Norden, M. J. H. Heule
ALDT
2009
Springer
144views Algorithms» more  ALDT 2009»
14 years 4 months ago
Aggregating Interval Orders by Propositional Optimization
Aggregating preferences for finding a consensus between several agents is an important issue in many fields, like economics, decision theory and artificial intelligence. In this...
Daniel Le Berre, Pierre Marquis, Meltem Özt&u...
ICASSP
2011
IEEE
13 years 1 months ago
On the implementation of MIMO-OFDM schemes using perturbation of the QR decomposition: Application to 3GPP LTE-a systems
Consider a flat-fading Multiple-Input Multiple-Output (MIMO) system. The near-optimum detection problematic has been shown to be efficiently solved through QR Decomposition (QRD...
Sébastien Aubert, Jane Tournois, Fabienne N...