Sciweavers

89 search results - page 14 / 18
» Abstraction Heuristics Extended with Counting Abstractions
Sort
View
ATAL
2006
Springer
15 years 1 months ago
Adaptive Pricing for Customers with Probabilistic Valuations
Abstract. In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. ...
Michael Benisch, James Andrews, Norman M. Sadeh
CPAIOR
2006
Springer
15 years 1 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
AAECC
2007
Springer
111views Algorithms» more  AAECC 2007»
14 years 9 months ago
When cache blocking of sparse matrix vector multiply works and why
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
Rajesh Nishtala, Richard W. Vuduc, James Demmel, K...
IJSNET
2006
110views more  IJSNET 2006»
14 years 9 months ago
Improving network lifetime using sensors with adjustable sensing ranges
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
Mihaela Cardei, Jie Wu, Mingming Lu
IJSNET
2008
138views more  IJSNET 2008»
14 years 9 months ago
Energy-efficient connected-coverage in wireless sensor networks
Abstract: This paper addresses the target coverage problem in wireless sensor networks. Communication and sensing consume energy, therefore efficient power management can extend ne...
Ionut Cardei, Mihaela Cardei