4744 search results - page 787 / 949 » Connected Computing |
173
click to vote
JIIS
2002
15 years 6 months ago
2002
Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memo...
195
click to vote
DAM
1999
15 years 6 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
175
click to vote
TON
2002
15 years 6 months ago
2002
Abstract--Research on congestion-control algorithms has traditionally focused more on performance than on robustness of the closed-loop system to changes in network conditions. As ...
172
click to vote
COMBINATORICA
2007
15 years 6 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 ...
162
click to vote
PE
2007
Springer
15 years 6 months ago
2007
Springer
The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference betwee...