3318 search results - page 480 / 664 » The Weak Instance Model |
128
Voted
NETWORKS
2011
14 years 7 months ago
2011
In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
105
Voted
JMLR
2010
14 years 7 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
139
click to vote
ESOP
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
121
Voted
CCS
2011
ACM
14 years 24 days ago
2011
ACM
We conduct an extensive study of information leakage over the powerline infrastructure from eight televisions (TVs) spanning multiple makes, models, and underlying technologies. I...
140
Voted
DSN
2011
IEEE
14 years 18 days ago
2011
IEEE
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...