519 search results - page 54 / 104 » A New Approach to Strongly Polynomial Linear Programming |
176
click to vote
CSFW
1999
IEEE
15 years 9 months ago
1999
IEEE
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
165
click to vote
CCO
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
257
click to vote
TCAD
2011
15 years 13 days ago
2011
Abstract—This work introduces GRIP, a global routing technique via integer programming. GRIP optimizes wirelength and via cost directly without going through a traditional layer ...
131
click to vote
COR
2010
15 years 5 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
196
click to vote
SOFTCO
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. An artificial neural network with all its elements is a rather complex structure, not easily constructed and/or trained to perform a particular task. Consequently, severa...