Sciweavers

3096 search results - page 385 / 620
» The Generalized FITC Approximation
Sort
View
SIAMJO
2002
133views more  SIAMJO 2002»
15 years 6 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
SIAMJO
2002
142views more  SIAMJO 2002»
15 years 6 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...
TON
1998
90views more  TON 1998»
15 years 6 months ago
Effective bandwidths with priorities
—The notion of effective bandwidths has provided a useful practical framework for connection admission control and capacity planning in high-speed communication networks. The ass...
Arthur W. Berger, Ward Whitt
TIT
2002
101views more  TIT 2002»
15 years 6 months ago
Spectrally efficient noncoherent communication
This paper considers noncoherent communication over a frequency-nonselective channel in which the time-varying channel gain is unknown a priori, but is approximately constant over ...
Dilip Warrier, Upamanyu Madhow
SCHEDULING
2008
89views more  SCHEDULING 2008»
15 years 6 months ago
Batch scheduling of step deteriorating jobs
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladi...