Sciweavers

9842 search results - page 138 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
COMPUTING
2010
13 years 7 months ago
Modified HSS iteration methods for a class of complex symmetric linear systems
In this paper, we introduce and analyze a modification of the Hermitian and skewHermitian splitting iteration method for solving a broad class of complex symmetric linear systems....
Zhong-Zhi Bai, Michele Benzi, Fang Chen
TWC
2010
13 years 4 months ago
A Reduced-Complexity PTS-Based PAPR Reduction Scheme for OFDM Systems
In this paper, a reduced-complexity partial transmit sequences (PTS) scheme is proposed to resolve the intrinsic high peak-to-average power ratio (PAPR) problem of orthogonal frequ...
Sheng-Ju Ku, Chin-Liang Wang, Chiuan-Hsu Chen
NFM
2011
335views Formal Methods» more  NFM 2011»
13 years 4 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
FM
1998
Springer
153views Formal Methods» more  FM 1998»
14 years 2 months ago
VSE: Controlling the Complexity in Formal Software Developments
We give an overview of the enhanced VSE system which is a tool to formally specify and verify systems. It provides means for structuring speci cations and it supports the developme...
Dieter Hutter, Heiko Mantel, Georg Rock, Werner St...
CEAS
2004
Springer
14 years 1 months ago
Managing Customer Opt-Outs in a Complex Global Environment
The day to day rhetoric associated with spam control focuses on measures, technology, rules or fees to impose order or control. These efforts concentrate on the broad range of mess...
Matt Leonard, Mayra Rodriguez, Richard Segal, Robe...