Sciweavers

6245 search results - page 171 / 1249
» A Case for Aggregate Networks
Sort
View
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
15 years 5 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 2 months ago
Centrality Metric for Dynamic Networks
Centrality is an important notion in network analysis and is used to measure the degree to which network structure contributes to the importance of a node in a network. While many...
Kristina Lerman, Rumi Ghosh, Jeon Hyung Kang
DSOM
2005
Springer
15 years 9 months ago
Decentralized Computation of Threshold Crossing Alerts
Threshold crossing alerts (TCAs) indicate to a management system that a management variable, associated with the state, performance or health of the network, has crossed a certain ...
Fetahi Wuhib, Mads Dam, Rolf Stadler, Alexander Cl...
NCA
2010
IEEE
14 years 11 months ago
Composable continuous-space programs for robotic swarms
Programmability is an increasingly important barrier to the deployment of multi-robot systems, as no prior approach allows routine composition and reuse of general aggregate behavi...
Jonathan Bachrach, Jacob Beal, James McLurkin
130
Voted
BROADNETS
2004
IEEE
15 years 7 months ago
Policy-Based Admission Control in GMPLS Optical Networks
In this paper we present a policy-based admission control architecture responsible for managing the installation and aggregation of packet-based LSPs within lightpaths (optical LS...
Fábio Luciano Verdi, Maurício F. Mag...