1101 search results - page 182 / 221 » An Algorithm for the Graph Crossing Number Problem |
106
click to vote
MAM
2007
15 years 1 months ago
2007
Examining the validity or accuracy of proposed available bandwidth estimation tools remains a challenging problem. A common approach consists of evaluating a newly developed tool ...
112
click to vote
ECCC
2006
15 years 1 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
129
click to vote
MOBICOM
2003
ACM
15 years 7 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
135
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
102
click to vote
VLSID
2002
IEEE
16 years 2 months ago
2002
IEEE
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...