1308 search results - page 152 / 262 » Let's Have a Conversation |
161
click to vote
MLQ
2007
15 years 5 months ago
2007
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
171
click to vote
QUESTA
2008
15 years 5 months ago
2008
We consider a discrete-time tree network of polling servers where all packets are routed to the same node (called node 0), from which they leave the network. All packets have unit...
151
click to vote
IEEECIT
2010
IEEE
15 years 4 months ago
2010
IEEE
—Distributed computing systems often strive to decouple their communicating components (threads on a single node, or nodes in a network) from each other with respect to time, spa...
197
click to vote
NA
2010
15 years 4 months ago
2010
It is well known that it is an ill-posed problem to decide whether a function has a multiple root. Even for a univariate polynomial an arbitrary small perturbation of a polynomial ...
165
click to vote
SIAMCOMP
2010
15 years 4 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...