Sciweavers

2182 search results - page 161 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
SIAMSC
2008
147views more  SIAMSC 2008»
13 years 9 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
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...
Michael P. Friedlander, Sven Leyffer
EGH
2005
Springer
14 years 2 months ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich
INFOCOM
2000
IEEE
14 years 22 days ago
Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
Tibor Cinkler, Dániel Marx, Claus Popp Lars...
CIKM
2009
Springer
14 years 3 months ago
Reducing the risk of query expansion via robust constrained optimization
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
Kevyn Collins-Thompson
ATAL
2008
Springer
13 years 11 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss