Select languages
Just click on one of the languages to switch to it.
Repository Created on September 17, 2015, 5:34 pm
Last updated on October 25, 2015, 8:37 pm
Repository Created on April 16, 2017, 8:35 pm
Bounded and Unbounded Verification Using Hardware and Software Verifiers
Last updated on December 6, 2017, 12:44 pm
Repository Created on November 14, 2016, 2:56 am
Last updated on May 31, 2019, 4:16 pm
Repository Created on September 24, 2017, 8:50 pm
Last updated on September 24, 2017, 8:58 pm
Repository Created on October 4, 2017, 8:07 pm
Artifact for POPL paper Foundations for Natural Proofs and Quantifier Instantiation
Last updated on October 4, 2017, 8:09 pm
Repository Created on October 15, 2018, 3:04 pm
Repo for Noisebox 2018 version (now officially v3)
Last updated on May 3, 2019, 8:22 pm
Repository Created on September 22, 2018, 9:00 pm
Last updated on February 22, 2019, 7:51 pm
Repository Created on April 25, 2018, 7:52 am
Last updated on April 25, 2018, 8:11 am
Repository Created on June 7, 2018, 5:14 pm
LIA (sat)
Last updated on June 7, 2018, 5:21 pm
Repository Created on July 27, 2018, 10:02 am
python27
Last updated on February 3, 2020, 4:34 am
Repository Created on April 23, 2019, 4:49 pm
Benchmarks from the CHC-COMP 2019
Last updated on September 28, 2019, 11:52 pm
Repository Created on June 7, 2019, 11:31 am
Abstracted Boolector
Last updated on September 10, 2019, 1:01 pm
Repository Created on January 4, 2019, 8:09 pm
Allows user to input a partially filled sudoku grid and outputs a complete sudoku grid with those squares. I use an SMT solver to find the solution.
Last updated on January 2, 2021, 5:45 pm
Repository Created on September 17, 2019, 1:50 am
Last updated on January 17, 2020, 1:17 am
Repository Created on January 16, 2019, 8:16 am
Recommendation Engine Module
Last updated on November 1, 2021, 1:35 pm
Repository Created on December 29, 2019, 6:54 pm
6800 CPU implemented in nmigen
Last updated on December 29, 2019, 6:54 pm
Repository Created on April 2, 2020, 7:08 pm
My experiments with SymbiYosys
Last updated on February 21, 2022, 12:18 am
Repository Created on November 21, 2019, 9:06 am
Software and CAD models of the footband FEEDI providing navigation information via haptic feedback
Last updated on April 6, 2020, 1:55 pm
Repository Created on June 10, 2020, 1:28 am
creating file to solve Killer Sudoku with Z3 Theorem Prover
Last updated on June 12, 2020, 3:03 am
Repository Created on June 14, 2020, 5:12 pm
Last updated on June 19, 2020, 4:29 pm
Repository Created on July 22, 2020, 6:24 am
Last updated on September 2, 2020, 4:07 pm
Repository Created on July 21, 2020, 8:05 pm
Examples to test sequence theory in cvc4
Last updated on July 21, 2020, 8:18 pm
Repository Created on September 21, 2020, 6:17 am
Last updated on September 21, 2020, 6:47 am
Repository Created on April 14, 2021, 5:16 am
Last updated on April 14, 2021, 11:58 am
Repository Created on February 11, 2021, 4:02 pm
Last updated on April 20, 2021, 10:14 pm
Repository Created on July 19, 2021, 6:00 pm
Last updated on July 19, 2021, 6:06 pm
Repository Created on July 14, 2021, 9:21 am
Last updated on September 7, 2021, 6:54 pm
Repository Created on February 22, 2022, 10:39 pm
Last updated on February 22, 2022, 10:39 pm
Repository Created on January 31, 2019, 1:59 am
SMTLIB syntax highlighting for Sublime Text 3
Last updated on March 14, 2022, 12:00 pm
Repository Created on May 11, 2022, 8:00 pm
It has become very common nowadays, especially after the outbreak of the COVID-19 pandemic, to send or receive items online (food, goods, clothes, documents, . . . ). Hence, it is more and more important for companies to efficiently schedule the dispatching of items through different couriers, in order to minimize the transportation costs. As the combinatorial decision and optimization expert, the student is assigned to solve the Multiple Couriers Planning (MCP) problem which is defined as follows. We have m couriers that must distribute n ≥ m items at different customer locations. Each courier i has a maximum load size li. Each item j has a distribution point dj and a size sj (which can represent for instance a weight or a volume). The goal of MCP is to decide for each courier the items to be distributed and plan a tour (i.e. a sequence of location points to visit) to perform the necessary distribution tasks. Each courier tour must start and end at a given origin point o. Moreover, the maximum load li of the courier i should be respected when items are assigned to it. The objective is to minimize the total tour distance.
Last updated on May 30, 2022, 4:22 pm