14158 search results - page 379 / 2832 » Generalized switch-setting problems |
150
click to vote
KDD
2010
ACM
15 years 3 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
129
click to vote
MFCS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to infinitesimal perturbations. Whereas the study in [1] was done only f...
192
click to vote
SWAT
2010
Springer
15 years 3 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
141
click to vote
TALG
2010
15 years 3 months ago
2010
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
125
click to vote
AAAI
2010
15 years 2 months ago
2010
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...