416 search results - page 30 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
128
click to vote
SODA
2010
ACM
16 years 7 days ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
137
click to vote
UAI
2004
15 years 4 months ago
2004
This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential au...
114
click to vote
EVOW
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. This work describes the use of genetic algorithms for automating the photogrammetric network design process. When planning a photogrammetric network, the cameras should b...
166
click to vote
IPCO
2001
15 years 4 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
133
click to vote
PAMI
2007
15 years 2 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...