Sciweavers

539 search results - page 95 / 108
» An Improved Upper Bound for SAT
Sort
View
HPDC
2010
IEEE
13 years 9 months ago
Toward high performance computing in unconventional computing environments
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
Brent Rood, Nathan Gnanasambandam, Michael J. Lewi...
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
13 years 9 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
TCOM
2008
105views more  TCOM 2008»
13 years 8 months ago
High-rate diversity across time and frequency using linear dispersion
To improve performance of orthogonal frequency division multiplexing (OFDM) for fading channels, this paper proposes increasing frequency and time diversity using linear dispersion...
Jinsong Wu, Steven D. Blostein
IPM
2007
99views more  IPM 2007»
13 years 8 months ago
Percent perfect performance (PPP)
An information retrieval performance measure that is interpreted as the percent of perfect performance (PPP) can be used to study the effects of the inclusion of specific documen...
Robert M. Losee
TR
2008
107views more  TR 2008»
13 years 8 months ago
A New Shared Segment Protection Method for Survivable Networks with Guaranteed Recovery Time
Shared Segment Protection (SSP), compared with Shared Path Protection (SPP), and Shared Link Protection (SLP), provides an optimal protection configuration due to the ability of ma...
János Tapolcai, Pin-Han Ho, Dominique Verch...