1388 search results - page 68 / 278 » Approximability of Robust Network Design |
FODO
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. DDH extends the idea of dynamic hashing algorithms to distributed systems. DDH spreads data across multiple servers in a network using a novel autonomous location discove...
NN
2002
Springer
2002
Springer
Optimal design of regularization term and regularization parameter by subspace information criterion
13 years 7 months ago
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
APN
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this work, we address the problem of transient and steadystate analysis of a stochastic Petri net which includes non Markovian distributions with a finite support but ...
WASA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...