549 search results - page 32 / 110 » The corner arc algorithm |
128
click to vote
ATVA
2006
Springer
15 years 2 months ago
2006
Springer
Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here...
121
click to vote
NETWORKS
2007
14 years 10 months ago
2007
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...
IJAR
2010
14 years 8 months ago
2010
In the original formulation of influence diagrams (IDs), each model contained exactly one utility node. Tatman and Shachter (1990), introduced the possibility of having super-valu...
100
click to vote
TAMC
2009
Springer
15 years 5 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
ESA
2010
Springer
15 years 6 days ago
2010
Springer
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...