3820 search results - page 337 / 764 » Bounded Model Debugging |
139
click to vote
COMGEO
2008
ACM
15 years 4 months ago
2008
ACM
A wireless ad-hoc network can be represented as a graph in which the nodes represent wireless devices, and the links represent pairs of nodes that communicate directly by means of...
147
click to vote
JMLR
2006
15 years 4 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
146
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We dev...
141
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
113
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...