2252 search results - page 220 / 451 » Lower Bounds for Dynamic Algorithms |
128
click to vote
COMBINATORICA
2007
15 years 3 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
124
click to vote
CASC
2007
Springer
15 years 10 months ago
2007
Springer
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
153
click to vote
EUC
2007
Springer
15 years 10 months ago
2007
Springer
Networked embedded systems present unique challenges for system designers composing distributed applications with dyanmic, real-time, and resilience requirements. We consider the ...
162
click to vote
ROBOCOMM
2007
IEEE
15 years 10 months ago
2007
IEEE
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
140
Voted
ISCC
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper we focus on issues of restorable dynamic routing in MPLS networks. We assume that the considered MPLS network must provide reliable service including restorable rout...