نتایج جستجو برای: perfect specialization
تعداد نتایج: 60452 فیلتر نتایج به سال:
We define a specialization inheritance mechanism for object-oriented programming, admitting covariant redefinition of both methods and instance variables in subclassing. We investigate on the semantic weakness that makes such very flexible inheritance infeasible for a statically type-checked programming language supporting polymorphic assignment and polymorphic method invocation. We show that t...
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 CHAPTER
Design patterns offer many advantages for software development, but can introduce inefficiency into the final program. Program specialization can eliminate such overheads, but is most effective when targeted by the user to specific bottlenecks. Consequently, we propose that these concepts are complementary. Program specialization can optimize programs written using design patterns, and design p...
The Strong Perfect Graph Conjecture, suggested by Claude Berge in 1960, had a major impact on the development of graph theory over the last forty years. It has led to the definitions and study of many new classes of graphs for which the Strong Perfect Graph Conjecture has been verified. Powerful concepts and methods have been developed to prove the Strong Perfect Graph Conjecture for these spec...
In this paper we give a characterization of kernel-perfect (and of critical kernel-imperfect) arc-local tournament digraphs. As a consequence, we prove that arc-local tournament digraphs satisfy a strenghtened form of the following interesting conjecture which constitutes a bridge between kernels and perfectness in digraphs, stated by C. Berge and P. Duchet in 1982: a graph G is perfect if and ...
In this article, we present a characterization of basic graphs in terms of forbidden induced subgraphs. This class of graphs was introduced by Conforti, Cornuéjols and Vušković [3], and it plays an essential role in the announced proof of the Strong Perfect Graph Conjecture by Chudnovsky, Robertson, Seymour and Thomas [2]. Then we apply the Reducing Pseudopath Method [13] to characterize the su...
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in other constructions, such as superimposed codes and perfect hash families etc. The existence of super-simple (v, 4, λ)-BIBDs have been determined for λ = 2, 3, 4 and 6. When λ = 5, the necessary conditions of such a d...
Organic computing calls for efficient adaptive systems in which flexibility is not traded in against stability and robustness. Such systems have to be specialized in the sense that they are biased towards solving instances from certain problem classes, namely those problems they may face in their environment. Nervous systems are perfect examples. Their specialization stems from evolution and de...
Large-scale geographical patterns of biotic specialization and the underlying drivers are poorly understood, but it is widely believed that climate plays an important role in determining specialization. As climate-driven range dynamics should diminish local adaptations and favor generalization, one hypothesis is that contemporary biotic specialization is determined by the degree of past climati...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید