10988 search results - page 398 / 2198 » Algorithmic Folding Complexity |
110
Voted
ISCAS
2006
IEEE
15 years 11 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...
120
click to vote
ICCS
2004
Springer
15 years 10 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 ...
161
click to vote
ICES
2003
Springer
15 years 10 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...
143
click to vote
FOCS
1997
IEEE
15 years 9 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...
174
click to vote
ICTAI
1992
IEEE
15 years 9 months ago
1992
IEEE
This paper describes an approach being explored to improve the usefulness of machine learning techniques for generating classification rules for complex, real world data. The appr...