1158 search results - page 136 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
162
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
130
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
137
click to vote
IJCAI
2003
15 years 7 months ago
2003
Muhiagent systems (MAS) can "go down" for a large number of reasons, ranging from system malfunctions and power failures to malicious attacks. The placement of agents on...
155
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
170
click to vote
UAI
2001
15 years 7 months ago
2001
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...