15485 search results - page 491 / 3097 » Computing Optimal Subsets |
198
click to vote
SIAMSC
2008
15 years 6 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
195
click to vote
AI
1999
Springer
15 years 6 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
175
click to vote
MVA
2002
15 years 6 months ago
2002
Velocity Picking is the problem of picking velocity-time pairs based on a coherence metric between multiple seismic signals. Coherence as a function of velocity and time can be ex...
201
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
214
click to vote
ATMOS
2010
15 years 5 months ago
2010
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...