Sciweavers

971 search results - page 142 / 195
» Planning with Reduced Operator Sets
Sort
View
ISCA
2006
IEEE
144views Hardware» more  ISCA 2006»
14 years 10 months ago
Conditional Memory Ordering
Conventional relaxed memory ordering techniques follow a proactive model: at a synchronization point, a processor makes its own updates to memory available to other processors by ...
Christoph von Praun, Harold W. Cain, Jong-Deok Cho...
JNW
2008
354views more  JNW 2008»
14 years 10 months ago
On the 20/40 MHz Coexistence of Overlapping BSSs in WLANs
Abstract-- We investigate the impact of 20/40 MHz coexistence on the performance of wireless local area networks (WLANs). To that end, we present simulation results of overlapping ...
Ariton E. Xhafa, Anuj Batra, Artur Zaks
WWW
2008
ACM
15 years 10 months ago
Efficient multi-keyword search over p2p web
Current search mechanisms of DHT-based P2P systems can well handle a single keyword search problem. Other than single keyword search, multi-keyword search is quite popular and use...
Hanhua Chen, Hai Jin, Jiliang Wang, Lei Chen 0002,...
TKDE
2010
148views more  TKDE 2010»
14 years 8 months ago
False Negative Problem of Counting Bloom Filter
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang
JSSPP
2007
Springer
15 years 4 months ago
QBETS: Queue Bounds Estimation from Time Series
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
Daniel Nurmi, John Brevik, Richard Wolski