Sciweavers

3415 search results - page 386 / 683
» Lower bounds on kernelization
Sort
View
SIROCCO
2003
15 years 8 months ago
The Cost of Concurrent, Low-Contention Read-Modify-Write
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
Costas Busch, Marios Mavronicolas, Paul G. Spiraki...
IOPADS
1997
152views more  IOPADS 1997»
15 years 8 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
AI
2005
Springer
15 years 6 months ago
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
Zhao Xing, Weixiong Zhang
TSP
2008
132views more  TSP 2008»
15 years 6 months ago
Differential Modulations for Multinode Cooperative Communications
Abstract--This paper proposes and analyzes differential modulation schemes for two cooperation protocols in multinode cooperative wireless networks; namely, multinode differential ...
Thanongsak Himsoon, W. Pam Siriwongpairat, Weifeng...
TPDS
2010
222views more  TPDS 2010»
15 years 5 months ago
Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
—Geographic routing is an attractive localized routing scheme for wireless sensor networks (WSNs) due to its desirable scalability and efficiency. Maintaining neighborhood inform...
Haibo Zhang, Hong Shen