5647 search results - page 703 / 1130 » A word from the editor |
191
Voted
MP
2006
15 years 6 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
210
click to vote
MST
2006
15 years 6 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
195
Voted
NJC
2006
15 years 6 months ago
2006
Object-oriented frameworks play an essential role in the implementation of product-line architectures (PLAs) for product families. However, recent case studies reveal that deriving...
176
Voted
IIE
2007
15 years 6 months ago
2007
This article presents an approach to using open-source tools and open-source projects to add realistic and practical examples to a course on software design in a professional maste...
177
click to vote
SIAMIS
2008
15 years 6 months ago
2008
We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorith...