Sciweavers

1510 search results - page 209 / 302
» Upper Probabilities and Additivity
Sort
View
ALGORITHMICA
2002
84views more  ALGORITHMICA 2002»
15 years 4 months ago
On-Line Multi-Threaded Paging
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...
Esteban Feuerstein, Alejandro Strejilevich de Loma
DM
2000
108views more  DM 2000»
15 years 4 months ago
On completeness of word reversing
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...
Patrick Dehornoy
SIAMCO
2000
89views more  SIAMCO 2000»
15 years 4 months ago
Stability Radius and Internal Versus External Stability in Banach Spaces: An Evolution Semigroup Approach
In this paper the theory of evolution semigroups is developed and used to provide a framework to study the stability of general linear control systems. These include autonomous and...
Stephen Clark, Yuri Latushkin, Stephen Montgomery-...
IJRR
2002
143views more  IJRR 2002»
15 years 4 months ago
Persistent Passive Hopping and Juggling is Possible Even With Plastic Collisions
We describe simple one-dimensional models of passive (no energy input, no control), generally dissipative, vertical hopping and oneball juggling. The central observation is that i...
Anindya Chatterjee, R. Pratap, C. K. Reddy, Andy R...
COMBINATORICS
1999
64views more  COMBINATORICS 1999»
15 years 4 months ago
Orthogonal Colorings of Graphs
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
Yair Caro, Raphael Yuster