13987 search results - page 542 / 2798 » The Two Guards Problem |
153
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
199
click to vote
AGENTS
1999
Springer
15 years 11 months ago
1999
Springer
We consider the problem of how to design large decentralized multiagent systems (MAS’s) in an automated fashion, with little or no hand-tuning. Our approach has each agent run a...
171
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
170
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
We consider a mixed linear system model, with both continuous and discrete inputs and outputs, described by a coefficient matrix and a set of noise variances. When the discrete inp...
174
click to vote
COCO
2010
Springer
15 years 11 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...