Sciweavers

2005 search results - page 393 / 401
» Decisive Markov Chains
Sort
View
WWW
2007
ACM
14 years 8 months ago
Speeding up adaptation of web service compositions using expiration times
Web processes must often operate in volatile environments where the quality of service parameters of the participating service providers change during the life time of the process...
John Harney, Prashant Doshi
KDD
2008
ACM
159views Data Mining» more  KDD 2008»
14 years 7 months ago
Semi-supervised learning with data calibration for long-term time series forecasting
Many time series prediction methods have focused on single step or short term prediction problems due to the inherent difficulty in controlling the propagation of errors from one ...
Haibin Cheng, Pang-Ning Tan
INFOCOM
2009
IEEE
14 years 2 months ago
Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule
—This paper considers the design of opportunistic packet schedulers for users sharing a time-varying wireless channel from the performance and the robustness points of view. Firs...
Bilal Sadiq, Seung Jun Baek, Gustavo de Veciana
CPAIOR
2009
Springer
14 years 2 months ago
Optimal Interdiction of Unreactive Markovian Evaders
The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdi...
Alexander Gutfraind, Aric A. Hagberg, Feng Pan
IPCCC
2007
IEEE
14 years 1 months ago
Optimising Networks Against Malware
Rapidly-spreading malicious software is an important threat on today’s computer networks. Most solutions that have been proposed to counter this threat are based on our ability ...
Pierre-Marc Bureau, José M. Fernandez