2182 search results - page 111 / 437 » A Robust Algorithm for Solving Nonlinear Programming Problem... |
181
click to vote
CPM
2000
Springer
15 years 10 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
154
click to vote
SMA
2003
ACM
15 years 11 months ago
2003
ACM
In this paper we present a new algorithm for solving the data dependent fairing problem for subdivision surfaces, using Catmull-Clark surfaces as an example. Earlier approaches to...
227
click to vote
TON
2010
15 years 1 months ago
2010
Abstract--We consider a scheduled orthogonal frequency division multiplexed (OFDM) wireless cellular network where the channels from the base-station to the mobile users undergo fl...
157
click to vote
EMNLP
2010
15 years 4 months ago
2010
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
197
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...