中文
相关论文

相关论文: Weak Evolvability Equals Strong Evolvability

200 篇论文

Weighted labelled transition systems are LTSs whose transitions are given weights drawn from a commutative monoid. WLTSs subsume a wide range of LTSs, providing a general notion of strong (weighted) bisimulation. In this paper we extend…

计算机科学中的逻辑 · 计算机科学 2013-10-16 Marino Miculan , Marco Peressotti

Verifiable generation aims to let the large language model (LLM) generate text with supporting documents, which enables the user to flexibly verify the answer and makes the LLM's output more reliable. Retrieval plays a crucial role in…

计算与语言 · 计算机科学 2024-03-28 Xiaonan Li , Changtai Zhu , Linyang Li , Zhangyue Yin , Tianxiang Sun , Xipeng Qiu

The aim of boosting is to convert a sequence of weak learners into a strong learner. At their heart, these methods are fully sequential. In this paper, we investigate the possibility of parallelizing boosting. Our main contribution is a…

机器学习 · 计算机科学 2023-08-22 Amin Karbasi , Kasper Green Larsen

Evolution is a dynamic process. The two classical forces of evolution are mutation and selection. Assuming small mutation rates, evolution can be predicted based solely on the fitness differences between phenotypes. Predicting an…

种群与进化 · 定量生物学 2015-03-23 Benedikt Bauer , Chaitanya S. Gokhale

We discuss a conjecture about comparability of weak and strong moments of log-concave random vectors and show the conjectured inequality for unconditional vectors in normed spaces with a bounded cotype constant.

概率论 · 数学 2014-09-19 Rafał Latała

It has been hypothesized that one of the main reasons evolution has been able to produce such impressive adaptations is because it has improved its own ability to evolve -- "the evolution of evolvability". Rupert Riedl, for example, an…

In this article we investigate the relationships between the classical notions of weakest precondition and weakest liberal precondition, and provide several results, namely that in general, weakest liberal precondition is neither stronger…

编程语言 · 计算机科学 2015-12-15 Andrew E. Santosa

In many-to-many matching models, substitutable preferences constitute the largest domain for which a pairwise stable matching is guaranteed to exist. In this note, we extend the recently proposed algorithm of Hatfield et al. [3] to test…

计算机科学与博弈论 · 计算机科学 2012-01-04 Haris Aziz , Markus Brill , Paul Harrenstein

We show that Weak Vop\v{e}nka's Principle, which is the statement that the opposite category of ordinals cannot be fully embedded into the category of graphs, is equivalent to the large cardinal principle Ord is Woodin, which says that for…

逻辑 · 数学 2020-01-27 Trevor M. Wilson

Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of Mathematical Operational Semantics to higher-order languages. The fundamental well-behavedness property of all specifications within the framework is that…

编程语言 · 计算机科学 2023-09-29 Henning Urbat , Stelios Tsampas , Sergey Goncharov , Stefan Milius , Lutz Schröder

Checkpointing large amounts of related data concurrently to stable storage is a common I/O pattern of many HPC applications. However, such a pattern frequently leads to I/O bottlenecks that lead to poor scalability and performance. As…

分布式、并行与集群计算 · 计算机科学 2021-03-04 Bogdan Nicolae , Adam Moody , Gregory Kosinovsky , Kathryn Mohror , Franck Cappello

As the marvellous growth of the digital library in each year, the problems with indexing and searching a digital library is increased in a high rate. When the researchers search for the earlier versions, only a few recent versions in the…

信息检索 · 计算机科学 2014-05-09 Thangaraj M , Gayathri V

With the fast growth of the Internet, more and more information is available on the Web. The Semantic Web has many features which cannot be handled by using the traditional search engines. It extracts metadata for each discovered Web…

人工智能 · 计算机科学 2011-11-30 Ahmed Tolba , Nabila Eladawi , Mohammed Elmogy

We show that supercompactness and strong compactness can be equivalent even as properties of pairs of regular cardinals. Specifically, we show that if V models ZFC + GCH is a given model (which in interesting cases contains instances of…

逻辑 · 数学 2016-09-06 Arthur Apter , Saharon Shelah

In this paper a new conjecture equivalent to Collatz conjecture is presented. In particural, showing that (all) the solution(s) of newly introduced iterative functional equation(s) have a given property is equivalent to prove Collatz…

综合数学 · 数学 2023-05-18 Giulio Masetti

Responsible use of Authorship Verification (AV) systems not only requires high accuracy but also interpretable solutions. More importantly, for systems to be used to make decisions with real-world consequences requires the model's…

Expression level is known to be a strong determinant of a protein's rate of evolution. But the converse can also be true: evolutionary dynamics can affect expression levels of proteins. Having implications in both directions fosters the…

种群与进化 · 定量生物学 2021-06-09 Jacob Moran , Devon Finlay , Mikhail Tikhonov

Reproducibility is an important feature of science; experiments are retested, and analyses are repeated. Trust in the findings increases when consistent results are achieved. Despite the importance of reproducibility, significant work is…

数字图书馆 · 计算机科学 2023-01-12 Akhil Pandey Akella , Hamed Alhoori , David Koop

We give a short, self-contained, and elementary proof of the strong law of large numbers under a power law decay hypothesis for joint second moments. The result is related to the classical one by Lyons. However, we also provide a rate of…

概率论 · 数学 2019-11-18 Abdelmalek Abdesselam

Quantifying bias in retrieval functions through document retrievability scores is vital for assessing recall-oriented retrieval systems. However, many studies investigating retrieval model bias lack validation of their query generation…

信息检索 · 计算机科学 2024-04-16 Aman Sinha , Priyanshu Raj Mall , Dwaipayan Roy
‹ 上一页 1 8 9 10 下一页 ›