1404 search results - page 173 / 281 » Optimization problems in multiple-interval graphs |
RIVF
2003
14 years 11 months ago
2003
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
WADS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the ...
ICIP
2009
IEEE
15 years 11 months ago
2009
IEEE
We propose a new fibre tracking algorithm for cardiac DTMRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We formulate the...
SBACPAD
2003
IEEE
15 years 3 months ago
2003
IEEE
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...