45 search results - page 9 / 9 » Fast, Approximately Optimal Solutions for Single and Dynamic... |
JMLR
2010
13 years 12 days ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
DCOSS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
ICRA
2008
IEEE
14 years 1 days ago
2008
IEEE
— Target tracking has two variants that are often studied independently with different approaches: target searching requires a robot to find a target initially not visible, and ...
WWW
2007
ACM
14 years 6 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
ADHOC
2007
13 years 5 months ago
2007
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...