373 search results - page 33 / 75 » An ACO Algorithm for the Most Probable Explanation Problem |
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
STOC
2003
ACM
14 years 8 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,...
IPSN
2003
Springer
14 years 1 months ago
2003
Springer
In this paper we present a distributed, application-morphable, algorithm for waking up appropriate sensor nodes in a heterogeneous sensor network. We assume a sensor field consisti...
APPROX
2000
Springer
14 years 11 days ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...