207 search results - page 15 / 42 » Run-Time Switching Between Total Order Algorithms |
BROADNETS
2006
IEEE
14 years 1 months ago
2006
IEEE
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— Virtual Output Queuing is widely used by highspeed packet switches to overcome head-of-line blocking. This is done by means of matching algorithms. In fixed-length VOQ...
ICTAI
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. Thi...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...