2252 search results - page 229 / 451 » Lower Bounds for Dynamic Algorithms |
133
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
132
Voted
GD
2003
Springer
15 years 9 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
106
click to vote
RTCSA
2000
IEEE
15 years 8 months ago
2000
IEEE
One of the hard problems in maintaining real-time systems requirements is to keep track of the impact of resource usage on the applications. Often times, it is not sufficient to ...
162
click to vote
COMPGEOM
1995
ACM
15 years 7 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
117
click to vote
EOR
2006
15 years 3 months ago
2006
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...