2056 search results - page 254 / 412 » time 2000 |
149
click to vote
JACM
2000
15 years 6 months ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
146
click to vote
SIAMSC
2010
15 years 4 months ago
2010
In this work we discuss a class of defect correction methods which is easily adapted to create parallel time integrators for multi-core architectures and is ideally suited for deve...
168
Voted
HYBRID
2000
Springer
15 years 9 months ago
2000
Springer
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
178
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency ...
177
click to vote
EATCS
1998
15 years 5 months ago
1998
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...