1204 search results - page 217 / 241 » Termination of Polynomial Programs |
115
Voted
EOR
2008
15 years 16 days 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 ...
IOR
2008
15 years 14 days ago
2008
A facility has to be located within a given region taking two criteria of equity and efficiency into account. Equity is sought by minimizing the inequality in the inhabitant-facil...
106
click to vote
DISOPT
2007
15 years 13 days ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
MP
2006
15 years 13 days ago
2006
Abstract. We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a "ring") to which...
135
click to vote
TDSC
2008
15 years 11 days ago
2008
Specifying and managing access control policies is a challenging problem. We propose to develop formal verification techniques for access control policies to improve the current s...