244 search results - page 35 / 49 » A Linear Search Strategy using Bounds |
ICCAD
1997
IEEE
14 years 24 days ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
COR
2010
13 years 8 months ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
CPM
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
JC
2006
13 years 8 months ago
2006
We discuss adaptive strategies for choosing regularization parameters in TikhonovPhillips regularization of discretized linear operator equations. Two rules turn out to be entirel...
CPAIOR
2007
Springer
14 years 2 months ago
2007
Springer
One of the most important policies adopted in inventory control is the (R,S) policy (also known as the “replenishment cycle” policy). Under the non-stationary demand assumption...