1941 search results - page 57 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
94
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
In the design of resource bounded agents, high-level cognitive activities, such as reasoning, raise important problems related both to the adaptive ability and to the computationa...
107
Voted
IPSN
2004
Springer
15 years 6 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
119
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
88
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
101
click to vote
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
We provide a framework to exploit dependencies among arms in multi-armed bandit problems, when the dependencies are in the form of a generative model on clusters of arms. We find ...