4047 search results - page 166 / 810 » The Discrete Basis Problem |
98
Voted
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
100
click to vote
ALGORITHMICA
2010
15 years 29 days ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
125
click to vote
ANOR
2007
15 years 29 days ago
2007
The quality of multi-stage stochastic optimization models as they appear in asset liability management, energy planning, transportation, supply chain management, and other applicat...
86
Voted
SAC
2009
ACM
15 years 7 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...
102
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...