2103 search results - page 74 / 421 » Approximate Learning of Dynamic Models |
152
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
196
Voted
CAISE
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Flexibility and automatic learning are key aspects to support users in dynamic business environments such as value chains across SMEs or when organizing a large event. Pr...
115
Voted
UAI
1996
15 years 3 months ago
1996
We discuss Bayesian methods for learning Bayesian networks when data sets are incomplete. In particular, we examine asymptotic approximations for the marginal likelihood of incomp...
140
click to vote
SDM
2007
SIAM
15 years 4 months ago
2007
SIAM
Many clustering algorithms have been proposed to partition a set of static data points into groups. In this paper, we consider an evolutionary clustering problem where the input d...
110
Voted
TNN
2008
15 years 2 months ago
2008
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...