Sciweavers

1477 search results - page 28 / 296
» Complexity of (iterated) dominance
Sort
View
ECCC
2007
90views more  ECCC 2007»
15 years 6 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
ICC
2008
IEEE
16 years 16 days ago
MMSE Soft-Interference-Cancellation Aided Iterative Center-Shifting K-Best Sphere Detection for MIMO Channels
—Based on an EXtrinsic Information Transfer (EXIT) chart-assisted receiver design, a low-complexity near-Maximum A Posteriori (MAP) detector is constructed for high-throughput sy...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo
PVM
1998
Springer
15 years 10 months ago
Implementation of Monte Carlo Algorithms for Eigenvalue Problem Using MPI
The problem of evaluating the dominant eigenvalue of real matrices using Monte Carlo numerical methods is considered. Three almost optimal Monte Carlo algorithms are presented:
Ivan Dimov, Vassil N. Alexandrov, Aneta Karaivanov...
CIA
2006
Springer
15 years 9 months ago
Iterative Query-Based Approach to Efficient Task Decomposition and Resource Allocation
Intelligent coordination in complex multi-agent environments requires sophisticated mechanisms for suboptimal task decomposition and efficient resource allocation provided by the t...
Michal Pechoucek, Ondrej Lerch, Jirí B&iacu...
ICFP
2006
ACM
16 years 6 months ago
A technique for generic iteration and its optimization
Software libraries rely increasingly on iterators to provide generic traversal of data structures. These iterators can be represented either as objects that maintain state or as p...
Stephen M. Watt