Sciweavers

1512 search results - page 50 / 303
» When Suboptimal Rules
Sort
View
CADE
2007
Springer
16 years 4 months ago
An Incremental Technique for Automata-Based Decision Procedures
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
David Toman, Gulay Ünel
ICC
2009
IEEE
122views Communications» more  ICC 2009»
15 years 11 months ago
Subset Selection in Type-II Hybrid ARQ/FEC for Video Multicast
—This paper proposes an error control scheme that minimizes the total distortion experienced by the receivers using a version of Type-II hybrid ARQ/FEC. Based on the feedback inf...
S. Mohsen Amiri, Ivan V. Bajic
ICASSP
2008
IEEE
15 years 10 months ago
Worst- and average-case complexity of LLL lattice reduction in MIMO wireless systems
Lattice reduction by means of the LLL algorithm has been previously suggested as a powerful preprocessing tool that allows to improve the performance of suboptimal detectors and t...
Joakim Jalden, Dominik Seethaler, Gerald Matz
IPPS
2007
IEEE
15 years 10 months ago
A Resource Allocation Problem in Replicated Peer-to-Peer Storage Systems
This paper focuses on peer-to-peer storage systems that achieve availability through replication. We study the problem of resource allocation when the system must replicate multip...
Sriram Ramabhadran, Joseph Pasquale
ECRTS
2006
IEEE
15 years 10 months ago
Optimal On-Line Scheduling of Multiple Control Tasks: A Case Study
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
Anton Cervin, Peter Alriksson