Results 211 to 220 of about 306,187 (255)
Some of the next articles are maybe not open access.
Refining by architectural styles or architecting by refinements
Joint proceedings of the second international software architecture workshop (ISAW-2) and international workshop on multiple perspectives in software development (Viewpoints '96) on SIGSOFT '96 workshops, 1996In L. Vidal, A.Finkelstein, G. Spanoudakis, and A. L. Wolf (eds) Joint Proceedings of the ACM SIGSOFT 96 Workshops, Part I, 2nd Int. Software Architecture Workshop. S.
MONTANGERO, CARLO, SEMINI, LAURA
openaire +3 more sources
Journal of Algorithms, 1993
Factor refinement (in \(\mathbb Z\)) refers to the transition from \(m=m_ 1 m_ 2\) to \(m=\prod n_ i^{e_ i}\) where the \(n_ i\) are not necessarily prime but \(\gcd(n_ i n_ j)=1\). The method is to use only the gcd algorithm starting with \(d=\gcd(m_ 1,m_ 2)\) and \(m=(m_ 1/d)d^ 2 (m_ 2/d)\). Then proceed by induction. The process is of complexity \(O(
Eric Bach 0001 +2 more
openaire +3 more sources
Factor refinement (in \(\mathbb Z\)) refers to the transition from \(m=m_ 1 m_ 2\) to \(m=\prod n_ i^{e_ i}\) where the \(n_ i\) are not necessarily prime but \(\gcd(n_ i n_ j)=1\). The method is to use only the gcd algorithm starting with \(d=\gcd(m_ 1,m_ 2)\) and \(m=(m_ 1/d)d^ 2 (m_ 2/d)\). Then proceed by induction. The process is of complexity \(O(
Eric Bach 0001 +2 more
openaire +3 more sources
Alternatives to Laboratory Animals, 2013
Russell and Burch's principle of refinement has endured from its inception in the 1950s, to appear in today's EU ...
openaire +2 more sources
Russell and Burch's principle of refinement has endured from its inception in the 1950s, to appear in today's EU ...
openaire +2 more sources
Science in China Series F: Information Sciences, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Households that fail to refinance their mortgage when interest rates decline can lose out on substantial savings. Based on a large random sample of outstanding U.S. mortgages in December of 2010, we estimate that approximately 20% of households for whom refinancing would be optimal and who appeared unconstrained to do so, had not taken advantage of the
Keys, Benjamin J. +2 more
openaire +1 more source
2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2015
Algorithms for solving the consensus problem are fundamental to distributed computing. Despite their brevity, their ability to operate in concurrent, asynchronous, and failure-prone environments comes at the cost of complex and subtle behaviors. Accordingly, understanding how they work and proving their correctness is a non-trivial endeavor where ...
Ognjen Maric +2 more
openaire +2 more sources
Algorithms for solving the consensus problem are fundamental to distributed computing. Despite their brevity, their ability to operate in concurrent, asynchronous, and failure-prone environments comes at the cost of complex and subtle behaviors. Accordingly, understanding how they work and proving their correctness is a non-trivial endeavor where ...
Ognjen Maric +2 more
openaire +2 more sources
Metavariables and Conditional Refinements in the Refinement Calculus
1994We describe two techniques for the refinement calculus that facilitate goal-directed development. The techniques achieve this by allowing the deferring of decisions about the precise form of refinement steps, so high-level choices can be expressed as soon as those choices are appropriate.
Raymond G. Nickson, Lindsay J. Groves
openaire +2 more sources
Journal of the London Mathematical Society, 1975
A partition of a set is refined by splitting one of the subsets into two smaller subsets. Let \(f(n)\) denote the number of ways of transforming \(n\) indistinguishable objects into \(n\) singletons via a sequence of \(n-1\) refinements. The authors show that there exist constants \(c_1\) and \(c_2\) such that \(c^n_1n^{n/2}
Erdős, Paul +2 more
openaire +2 more sources
A partition of a set is refined by splitting one of the subsets into two smaller subsets. Let \(f(n)\) denote the number of ways of transforming \(n\) indistinguishable objects into \(n\) singletons via a sequence of \(n-1\) refinements. The authors show that there exist constants \(c_1\) and \(c_2\) such that \(c^n_1n^{n/2}
Erdős, Paul +2 more
openaire +2 more sources
The Least Conjunctive Refinement and Promotion in the Refinement Calculus
Formal Aspects of Computing, 1999Abstract. A syntactic calculation of Morgan's least conjunctive refinement operator for predicate transformers is developed. The operator is used to develop a general approach to lifting relational operators to predicate transformer operators.
openaire +3 more sources
Plastic & Reconstructive Surgery, 2020
Summary: With a growing massive weight loss population, upper arm contouring continues to rise in popularity. Refinements in technique, such as modification of skin excision patterns and the adjunct use of liposuction, have allowed for safe and reproducible results.
Rod J, Rohrich +2 more
openaire +2 more sources
Summary: With a growing massive weight loss population, upper arm contouring continues to rise in popularity. Refinements in technique, such as modification of skin excision patterns and the adjunct use of liposuction, have allowed for safe and reproducible results.
Rod J, Rohrich +2 more
openaire +2 more sources

