1578 search results - page 185 / 316 » Direct Routing: Algorithms and Complexity |
IPSN
2009
Springer
14 years 4 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
GIS
2007
ACM
14 years 11 months ago
2007
ACM
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...
DAC
2002
ACM
14 years 11 months ago
2002
ACM
The ability to compute the parasitic inductance of the interconnect is critical to the timing verification of modern VLSI circuits. A challenging aspect of inductance extraction i...
AINA
2008
IEEE
14 years 4 months ago
2008
IEEE
—In the paper, we study the wavelength assignment problem in waveband switching (WBS) networks, which is composed of multi-granular optical cross-connect (MG-OXCs) interconnected...
CODES
2006
IEEE
14 years 4 months ago
2006
IEEE
Design of System-on-Chip (SoC) with regular mesh based Network-on-Chip (NoC) consists of mapping processing cores to routers, and routing of the traffic traces on the topology suc...