Sciweavers

338 search results - page 15 / 68
» Effective Lower Bounding Techniques for Pseudo-Boolean Optim...
Sort
View
COCOON
2007
Springer
14 years 2 months ago
Online Interval Scheduling: Randomized and Multiprocessor Cases
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zhen...
SAC
2005
ACM
14 years 1 months ago
Efficient placement and routing in grid-based networks
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
Roozbeh Jafari, Foad Dabiri, Bo-Kyung Choi, Majid ...
IPL
2006
141views more  IPL 2006»
13 years 8 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan
QEST
2006
IEEE
14 years 2 months ago
Bound-Preserving Composition for Markov Reward Models
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
David Daly, Peter Buchholz, William H. Sanders
PE
2002
Springer
150views Optimization» more  PE 2002»
13 years 7 months ago
Delimiting the range of effectiveness of scalable on-demand streaming
Previous analyses of scalable streaming protocols for delivery of stored multimedia have largely focused on how the server bandwidth required for full-file delivery scales as the ...
Haonan Tan, Derek L. Eager, Mary K. Vernon