2926 search results - page 157 / 586 » Partially Optimal Routing |
108
click to vote
ISCAS
1995
IEEE
15 years 6 months ago
1995
IEEE
We present a novel technique for datapath allocation, which incorporates interconnection area and delay estimates based on dynamic oorplanning. In this approach, datapath area is ...
121
click to vote
ALENEX
2001
15 years 4 months ago
2001
Abstract. We present a generic package for resource constrained network optimization problems. We illustrate the flexibility and the use of our package by solving four applications...
151
click to vote
INFOCOM
2002
IEEE
15 years 8 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
118
click to vote
PAAMS
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
120
click to vote
WIOPT
2005
IEEE
15 years 8 months ago
2005
IEEE
We propose a model under which several inherent properties of the Exponential Age SEarch routing protocol can be derived. By making simplifications on this model, we are able to ...