187 search results - page 19 / 38 » Benchmarking and solving dynamic constrained problems |
ICCAD
2003
IEEE
15 years 6 months ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
CPAIOR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. An optimization problem arising in the design of optical fibre networks is discussed. A network contains client nodes, each installed on one or more SONET rings. A const...
SAC
2005
ACM
15 years 3 months ago
2005
ACM
This paper addresses single and multiple container loading problems. We propose to use dynamic prioritization to handle awkward box types. The box type with a higher priority will...
62
Voted
IJBC
2007
14 years 9 months ago
2007
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...
CCS
2008
ACM
14 years 11 months ago
2008
ACM
Current taint tracking systems suffer from high overhead and a lack of generality. In this paper, we solve both of these issues with an extensible system that is an order of magni...