Sciweavers

551 search results - page 17 / 111
» Reducing the cost of applying adaptive test cases
Sort
View
CSCW
2008
ACM
13 years 10 months ago
Can markets help?: applying market mechanisms to improve synchronous communication
There is a growing interest in applying market mechanisms to tackle everyday communication problems such as communication interruptions and communication overload. Prior analytic ...
Gary Hsieh, Robert Kraut, Scott E. Hudson, Roberto...
TWC
2010
13 years 3 months ago
Reduced-Complexity Joint Baseband Compensation of Phase Noise and I/Q Imbalance for MIMO-OFDM Systems
The maximum likelihood estimate of the impulse response of a frequency-selective channel in the presence of phase noise and I/Q imbalance is derived. The complexity of the joint es...
Rabie Rabiei, Won Namgoong, Naofal Al-Dhahir
ICPP
2005
IEEE
14 years 2 months ago
An ACO-Based Approach for Scheduling Task Graphs with Communication Costs
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
Markus Bank, Udo Hönig, Wolfram Schiffmann
ICSM
2007
IEEE
14 years 2 months ago
Fault Detection Probability Analysis for Coverage-Based Test Suite Reduction
Test suite reduction seeks to reduce the number of test cases in a test suite while retaining a high percentage of the original suite’s fault detection effectiveness. Most appro...
Scott McMaster, Atif M. Memon
FMSD
2006
104views more  FMSD 2006»
13 years 8 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord