10608 search results - page 319 / 2122 » Complexity of O'Hara's Algorithm |
90
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We presen...
77
Voted
ISCAS
2006
IEEE
15 years 6 months ago
2006
IEEE
— In this paper, we describe a simple second-order discrete-time model for the Transmission Control Protocol (TCP) with Random Early Detection (RED) algorithm. The TCP/RED mechan...
ICCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
113
Voted
ICES
2003
Springer
15 years 5 months ago
2003
Springer
This paper proposes a coprocessor architecture to speed up hardware evolution. It is designed to be implemented in an FPGA with an integrated microprocessor core. The coprocessor r...
102
click to vote
FOCS
1997
IEEE
15 years 4 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...