9842 search results - page 1281 / 1969 » The Complexity of the Matching-Cut Problem |
177
click to vote
HYBRID
2009
Springer
16 years 2 months ago
2009
Springer
In this paper, we present an automatable decompositional method for the computation of Lyapunov functions for hybrid systems with complex discrete state spaces. We use graph-based ...
183
click to vote
GLOBECOM
2009
IEEE
16 years 2 months ago
2009
IEEE
— The problem of resource allocation (RA) in a downlink OFDMA system with minimum user rate requests is examined under the realistic scenario of partial (imperfect) channel state...
197
click to vote
ICASSP
2009
IEEE
16 years 2 months ago
2009
IEEE
The common zeros problem for blind system identification (BSI) is well known. It degrades the performance of classic BSI algorithms and therefore imposes the limit on the perform...
219
click to vote
ICC
2009
IEEE
16 years 2 months ago
2009
IEEE
—We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sug...
183
click to vote
ISMVL
2009
IEEE
16 years 2 months ago
2009
IEEE
For formal verification of hardware Satisfiability Modulo Theory (SMT) solvers are increasingly applied. Today’s state-of-the-art SMT solvers use different techniques like ter...