2343 search results - page 176 / 469 » The Locomotive Routing Problem |
130
click to vote
DAC
1993
ACM
15 years 10 months ago
1993
ACM
We present an efficient and effective method for the detailed routing of symmetrical or sea-of-gates FPGA architectures. Instead of breaking the problem into 2-terminal net collec...
144
click to vote
SPAA
1992
ACM
15 years 10 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
190
click to vote
AINA
2006
IEEE
15 years 10 months ago
2006
IEEE
Due to the nature of radio transmissions, communications in wireless networks are easy to capture and analyze. Next to this, privacy enhancing techniques (PETs) proposed for wired...
155
click to vote
AAAI
2004
15 years 7 months ago
2004
In this paper we report some of the research endeavors we are embarking on as part of the Doctoral research of the first author. We have already completed an investigation of some...
167
click to vote
ADHOC
2007
15 years 6 months ago
2007
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...