Sciweavers

952 search results - page 132 / 191
» Computational complexity of stochastic programming problems
Sort
View
NOSSDAV
2004
Springer
15 years 8 months ago
Reduced state fair queuing for edge and core routers
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
Ramana Rao Kompella, George Varghese
ICCSA
2007
Springer
15 years 7 months ago
Component Specification for Parallel Coupling Infrastructure
Coupled systems comprise multiple interacting subsystems and are an increasingly common computational science application, most notably as multiscale and multiphysics models. Paral...
Jay Walter Larson, Boyana Norris
ICML
1996
IEEE
16 years 3 months ago
On the Learnability of the Uncomputable
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Richard H. Lathrop
ACMSE
2007
ACM
15 years 7 months ago
A self-testing autonomic container
Many strategies have been proposed to address the problems associated with managing increasingly complex computing systems. IBM's Autonomic Computing (AC) paradigm is one suc...
Ronald Stevens, Brittany Parsons, Tariq M. King
EDCC
1999
Springer
15 years 7 months ago
Dependability Modelling and Sensitivity Analysis of Scheduled Maintenance Systems
Abstract. In this paper we present a new modelling approach for dependability evaluation and sensitivity analysis of Scheduled Maintenance Systems, based on a Deterministic and Sto...
Andrea Bondavalli, Ivan Mura, Kishor S. Trivedi