Sciweavers

1355 search results - page 120 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
ICALP
2010
Springer
13 years 11 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
WCNC
2008
IEEE
14 years 3 months ago
An Opportunistic Scheduling Scheme with Minimum Data-Rate Guarantees for OFDMA
Abstract—We tackle the problem of providing minimum datarate guarantees for different classes-of-service in an OFDMAbased network, while obtaining a high system throughput. Our a...
Razvan Pitic, Antonio Capone
ICDCS
2000
IEEE
14 years 21 days ago
Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory
Providing shared-memory abstraction in messagepassing systems often simplifies the development of distributed algorithms and allows for the reuse of sharedmemory algorithms in the...
Burkhard Englert, Alexander A. Shvartsman
VTC
2007
IEEE
14 years 3 months ago
Adaptive Conjugate Gradient DFEs for Wideband MIMO Systems Using Galerkin Projections
— Three new adaptive equalization algorithms for wireless systems operating over frequency selective MIMO channels are proposed. The problem of the MIMO DFE design is formulated ...
Vassilis Kekatos, Aris S. Lalos, Kostas Berberidis
DAC
1997
ACM
14 years 1 months ago
An Improved Algorithm for Minimum-Area Retiming
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
Naresh Maheshwari, Sachin S. Sapatnekar