Sciweavers

GLOBECOM
2007
IEEE
15 years 8 months ago
Capacity Assignment for Delay Bounded Packet Traffic
The capacity assignment (CA) problem is one of the most essential yet important topics in packet communication networks. However, most reported CA models were established under the...
Xian Liu
ESEM
2009
ACM
15 years 8 months ago
Test coverage and post-verification defects: A multiple case study
Test coverage is a promising measure of test effectiveness and development organizations are interested in costeffective levels of coverage that provide sufficient fault removal w...
Audris Mockus, Nachiappan Nagappan, Trung T. Dinh-...
165
Voted
GLOBECOM
2007
IEEE
15 years 8 months ago
Amplify-and-Forward Capacity with Transmit Beamforming for MIMO Multiple-Relay Channels
In this paper, we consider a MIMO wireless relay network where communication between a source and a destination node is assisted by multiple relay nodes using the Amplifyand-Forwar...
Erhan Yilmaz, M. Oguz Sunay
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
15 years 8 months ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
ERSHOV
2009
Springer
15 years 8 months ago
A Java Supercompiler and Its Application to Verification of Cache-Coherence Protocols
Abstract. The Java Supercompiler (JScp) is a specializer of Java programs based on the Turchin's supercompilation method and extended to support imperative and object-oriented...
Andrei V. Klimov