1144 search results - page 169 / 229 » Feasibility Studies |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
EOR
2008
13 years 9 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
IANDC
2008
13 years 9 months ago
2008
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
CCE
2006
13 years 9 months ago
2006
This paper reviews the status of graduate level process control education and surveys graduate process control offerings for more than 50 chemical engineering and control engineer...
COR
2006
13 years 8 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...