Sciweavers

2182 search results - page 59 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
SIAMNUM
2010
95views more  SIAMNUM 2010»
13 years 2 months ago
Robust BDDC Preconditioners for Reissner-Mindlin Plate Bending Problems and MITC Elements
A Balancing Domain Decomposition Method by Constraints (BDDC) is constructed and analyzed for the Reissner-Mindlin plate bending problem discretized with MITC finite elements. This...
L. Beirão da Veiga, C. Chinosi, Carlo Lovad...
COR
2004
99views more  COR 2004»
13 years 7 months ago
A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics
Fair bandwidth allocation is an important issue in the multicast network to serve each multicast traffic at a fair rate commensurate with the receiver's capabilities and the ...
Chae Y. Lee, Young P. Moon, Young Joo Cho
TRANSCI
2010
169views more  TRANSCI 2010»
13 years 2 months ago
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
Ilgaz Sungur, Yingtao Ren, Fernando Ordó&nt...
CP
2004
Springer
14 years 1 months ago
Decomposition and Learning for a Hard Real Time Task Allocation Problem
Abstract. We present a cooperation technique using an accurate management of nogoods to solve a hard real-time problem which consists in assigning periodic tasks to processors in t...
Hadrien Cambazard, Pierre-Emmanuel Hladik, Anne-Ma...
PAMI
2011
13 years 2 months ago
Dynamic Programming and Graph Algorithms in Computer Vision
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
Pedro F. Felzenszwalb, Ramin Zabih