457 search results - page 13 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
RANDOM
1998
Springer
13 years 11 months ago
1998
Springer
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
EPEW
2007
Springer
14 years 1 months ago
2007
Springer
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this clas...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper addresses the problem of restoring standing in paralegia via functional electrical stimulation (FES) and investigates the relashionship between body posture and volu...
COCO
2009
Springer
14 years 1 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
CPM
2010
Springer
14 years 5 days ago
2010
Springer
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...