3471 search results - page 644 / 695 » Obstacle Numbers of Graphs |
126
Voted
BROADNETS
2005
IEEE
15 years 9 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
118
Voted
ASPDAC
2005
ACM
15 years 9 months ago
2005
ACM
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
130
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
134
Voted
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
126
Voted
ILP
2004
Springer
15 years 9 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...