1414 search results - page 72 / 283 » Cover Time and Broadcast Time |
STOC
2003
ACM
14 years 11 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
AINA
2010
IEEE
14 years 4 months ago
2010
IEEE
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
RTSS
2002
IEEE
14 years 4 months ago
2002
IEEE
This paper describes a stochastic analysis method for general periodic real-time systems. The proposed method accurately computes the response time distribution of each task in th...
FORMATS
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...
JMLR
2006
13 years 11 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...