19700 search results - page 203 / 3940 » DNA-Based Computation Times |
112
click to vote
COMPUTER
2000
15 years 5 months ago
2000
To be an effective platform for performance-sensitive real-time systems, distributed object computing middleware must support application quality of service (QoS) requirements end...
138
click to vote
IPL
2000
15 years 5 months ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
126
click to vote
COMBINATORICS
1999
15 years 5 months ago
1999
F. Murnaghan observed a long time ago that the computation of the decompositon of the Kronecker product (n-a,2,... ) (n-b,
134
Voted
NETWORKS
2010
15 years 3 months ago
2010
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
166
click to vote
SIAMDM
2010
15 years 5 days ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...