4843 search results - page 286 / 969 » The Shortcut Problem - Complexity and Approximation |
114
click to vote
MOR
2010
15 years 2 months ago
2010
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
162
click to vote
JMLR
2010
14 years 10 months ago
2010
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
142
click to vote
PAMI
2012
13 years 6 months ago
2012
—We study the problem of approximating a 3D solid with a union of overlapping spheres. In comparison with a stateof-the-art approach, our method offers more than an order of magn...
157
click to vote
EDBT
2002
ACM
16 years 4 months ago
2002
ACM
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
109
click to vote
CEC
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...