1258 search results - page 27 / 252 » Architecture-driven Problem Decomposition |
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
COR
2008
13 years 8 months ago
2008
Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic...
INFORMS
2000
13 years 8 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
ANOR
2006
13 years 8 months ago
2006
This paper presents two contributions: A set of routines that manipulate instances of stochastic programming problems in order to make them more amenable for different solution ap...
FOCM
2011
13 years 3 months ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...