844 search results - page 97 / 169 » Solving the p |
153
click to vote
CCCG
2008
15 years 7 months ago
2008
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
141
click to vote
LREC
2010
15 years 7 months ago
2010
For many languages there are no large, general-language corpora available. Until the web, all but the richest institutions could do little but shake their heads in dismay as corpu...
151
click to vote
IPCO
2001
15 years 7 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
157
click to vote
NIPS
2004
15 years 7 months ago
2004
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
161
click to vote
UAI
2004
15 years 7 months ago
2004
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for representing continuous chance variables in influence diagrams. Also, MTE potentials c...