4037 search results - page 478 / 808 » Routing without ordering |
148
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
142
click to vote
ICCAD
2004
IEEE
16 years 1 months ago
2004
IEEE
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...
141
click to vote
FPGA
2010
ACM
16 years 1 months ago
2010
ACM
Placement based on simulated annealing is in dominant use in the FPGA community due to its superior quality of result (QoR). However, given the progression of FPGA device capacity...
148
click to vote
PAM
2009
Springer
15 years 11 months ago
2009
Springer
This paper describes a new tool for gathering (performance) data from optical network devices. During the last few years many National Research and Education Networks (NRENs) have ...
152
click to vote
SISAP
2009
IEEE
15 years 11 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...