10988 search results - page 357 / 2198 » Algorithmic Folding Complexity |
140
click to vote
FCS
2006
15 years 6 months ago
2006
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...
149
click to vote
ICN
2005
Springer
15 years 10 months ago
2005
Springer
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
115
click to vote
DCC
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
113
click to vote
DAGSTUHL
2006
15 years 6 months ago
2006
Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framewo...
110
Voted
PPSC
1997
15 years 6 months ago
1997
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...