Results 1  10
of
539,869
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
Long paths and cycles in random subgraphs of graphs with large minimum degree
, 2013
"... For a given finite graph G of minimum degree at least k, let Gp be a random subgraph of G obtained by taking each edge independently with probability p. We prove that (i) if p ≥ ω/k for a function ω = ω(k) that tends to infinity as k does, then Gp asymptotically almost surely contains a cycle (and ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
For a given finite graph G of minimum degree at least k, let Gp be a random subgraph of G obtained by taking each edge independently with probability p. We prove that (i) if p ≥ ω/k for a function ω = ω(k) that tends to infinity as k does, then Gp asymptotically almost surely contains a cycle
FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in LookupTable Based FPGA Designs
 IEEE TRANS. CAD
, 1994
"... The field programmable gatearray (FPGA) has become an important technology in VLSI ASIC designs. In the past a few years, a number of heuristic algorithms have been proposed for technology mapping in lookuptable (LUT) based FPGA designs, but none of them guarantees optimal solutions for general Bo ..."
Abstract

Cited by 317 (41 self)
 Add to MetaCart
is to compute a minimum height Kfeasible cut in a network, which is solved optimally in polynomial time based on network flow computation. Our algorithm also effectively minimizes the number of LUTs by maximizing the volume of each cut and by several postprocessing operations. Based on these results, we have
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
Learning with DegreeBased Subgraph Estimation
, 2011
"... Networks and their topologies are critical to nearly every aspect of modern life, with social networks governing human interactions and computer networks governing global informationflow. Network behavior is inherently structural, and thus modeling data from networks benefits from explicitly modeli ..."
Abstract
 Add to MetaCart
modeling structure. This thesis covers methods for and analysis of machine learning from network data while explicitly modeling one important measure of structure: degree. Central to this work is a procedure for exact maximum likelihood estimation of a distribution over graph structure, where
A RiskFactor Model Foundation for RatingsBased Bank Capital Rules
 Journal of Financial Intermediation
, 2003
"... When economic capital is calculated using a portfolio model of credit valueatrisk, the marginal capital requirement for an instrument depends, in general, on the properties of the portfolio in which it is held. By contrast, ratingsbased capital rules, including both the current Basel Accord and i ..."
Abstract

Cited by 283 (1 self)
 Add to MetaCart
When economic capital is calculated using a portfolio model of credit valueatrisk, the marginal capital requirement for an instrument depends, in general, on the properties of the portfolio in which it is held. By contrast, ratingsbased capital rules, including both the current Basel Accord and its proposed revision, assign a capital charge to an instrument based only on its own characteristics. I demonstrate that ratingsbased capital rules can be reconciled with the general class of credit VaR models. Contributions to VaR are portfolioinvariant only if (a) there is only a single systematic risk factor driving correlations across obligors, and (b) no exposure in a portfolio accounts for more than an arbitrarily small share of total exposure. Analysis of rates of convergence to asymptotic VaR leads to a simple and accurate portfoliolevel addon charge for undiversified idiosyncratic risk. There is no similarly simple way to address violation of the single factor assumption.
LONG CIRCUITS AND LARGE EULER SUBGRAPHS∗
"... Abstract. We study the parameterized complexity of the following Euler subgraph problems: (a) Large Euler Subgraph: For a given graphG and integer parameter k, doesG contain an induced Eulerian subgraph with at least k vertices? (b) Long Circuit: For a given graph G and integer parameter k, does G c ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We study the parameterized complexity of the following Euler subgraph problems: (a) Large Euler Subgraph: For a given graphG and integer parameter k, doesG contain an induced Eulerian subgraph with at least k vertices? (b) Long Circuit: For a given graph G and integer parameter k, does G
Long cycles in random subgraphs of graphs with large minimum degree, arXiv:1308.3144 [math.CO
"... Let G be any graph of minimum degree at least k, and let Gp be the random subgraph of G obtained by keeping each edge independently with probability p. Recently, Krivelevich, Lee and Sudakov showed that if pk → ∞ then with probability tending to 1 Gp contains a cycle of length at least (1 − o(1))k ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Let G be any graph of minimum degree at least k, and let Gp be the random subgraph of G obtained by keeping each edge independently with probability p. Recently, Krivelevich, Lee and Sudakov showed that if pk → ∞ then with probability tending to 1 Gp contains a cycle of length at least (1 − o(1
Results 1  10
of
539,869