2698 search results - page 421 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
Coordination of multiple agents under uncertainty in the decentralized POMDP model is known to be NEXP-complete, even when the agents have a joint set of goals. Nevertheless, we s...
ICALP
2003
Springer
14 years 3 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
ALENEX
2009
13 years 11 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
ATAL
2010
Springer
13 years 11 months ago
2010
Springer
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
BMCBI
2010
13 years 10 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...