163 search results - page 29 / 33 » Optimal Nonlinear Prediction of Random Fields on Networks |
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
108
click to vote
ISCC
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
103
click to vote
NIPS
2008
15 years 23 days ago
2008
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
120
click to vote
DIALM
2005
ACM
15 years 1 months ago
2005
ACM
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...