Sciweavers

6546 search results - page 111 / 1310
» Improving the Performance of the RISE Algorithm
Sort
View
162
Voted
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
15 years 8 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
107
Voted
INFSOF
2006
103views more  INFSOF 2006»
15 years 3 months ago
Improving test quality using robust unique input/output circuit sequences (UIOCs)
In finite state machine (FSM) based testing, the problem of fault masking in the unique input/output (UIO) sequence may degrade the test performance of the UIO based methods. This...
Qiang Guo, Robert M. Hierons, Mark Harman, Karnig ...
132
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu
120
Voted
VTC
2006
IEEE
15 years 9 months ago
Semi-Analytical Model of Interference in CDMA-TDD Using Random Time Slot Hopping
— In this paper, a semi-analytical approach for the performance analysis of the random time slot (TS) hopping (RTSH) algorithm applied to code division multiple access time divis...
Ellina Foutekova, Christine Evers, Harald Haas
140
Voted
IEEEPACT
2009
IEEE
15 years 10 months ago
Using Aggressor Thread Information to Improve Shared Cache Management for CMPs
—Shared cache allocation policies play an important role in determining CMP performance. The simplest policy, LRU, allocates cache implicitly as a consequence of its replacement ...
Wanli Liu, Donald Yeung