1 code implementation • 19 Dec 2022 • Yong Lai, Kuldeep S. Meel, Roland H. C. Yap
Model counting is a fundamental problem which has been influential in many applications, from artificial intelligence to formal verification.
1 code implementation • 27 Nov 2022 • Kaiyuan Yang, Houjing Huang, Olafs Vandans, Adithya Murali, Fujia Tian, Roland H. C. Yap, Liang Dai
This problem has been studied in a classical abstract model, the HP model, where the protein is modeled as a sequence of H (hydrophobic) and P (polar) amino acids on a lattice.
1 code implementation • 21 Feb 2022 • Yong Lai, Kuldeep S. Meel, Roland H. C. Yap
Knowledge compilation concerns with the compilation of representation languages to target languages supporting a wide range of tractable operations arising from diverse areas of computer science.
no code implementations • 22 Jan 2020 • Sahil Verma, Roland H. C. Yap
We transform CSP benchmarks into C programs suitable for testing the reasoning capabilities of symbolic execution tools.
Software Engineering Logic in Computer Science I.2.0; I.2.1; I.2.3; I.2.4; I.2.8; I.2.11; D.2
no code implementations • 10 May 2018 • Wei Xia, Roland H. C. Yap
However, choosing or designing a good search heuristic is non-trivial and is often a manual process.
no code implementations • 6 May 2018 • Ruiwei Wang, Wei Xia, Roland H. C. Yap
We evaluate our correlation heuristics with well known heuristics, namely, dom/wdeg, impact-based search and activity-based search.
1 code implementation • 1 Feb 2012 • Felix Halim, Stratos Idreos, Panagiotis Karras, Roland H. C. Yap
Stochastic cracking also uses each query as a hint on how to reorganize data, but not blindly so; it gains resilience and avoids performance bottlenecks by deliberately applying certain arbitrary choices in its decision-making.