4037 search results - page 161 / 808 » Routing without ordering |
101
Voted
AAAI
2007
15 years 3 months ago
2007
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
105
Voted
ICCAD
2010
IEEE
14 years 10 months ago
2010
IEEE
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...
94
Voted
CP
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we present a hybrid model for the demand acceptance variant of the routing and wavelength assignment problem in directed networks, an important benchmark problem in o...
94
Voted
VTC
2008
IEEE
15 years 7 months ago
2008
IEEE
— In order to accommodate the constantly growing number of vehicles on the road with which infrastructure provision is failing to cope, new means of optimizing the available road...
104
Voted
CAAN
2007
Springer
15 years 7 months ago
2007
Springer
Topological routing is basically table free, and allows for very fast restoration and thus a high level of reliability in communication. It has already been satisfactorily proposed...