Picture for Mark Lewis

Mark Lewis

Granite Code Models: A Family of Open Foundation Models for Code Intelligence

Add code
May 07, 2024
Figure 1 for Granite Code Models: A Family of Open Foundation Models for Code Intelligence
Figure 2 for Granite Code Models: A Family of Open Foundation Models for Code Intelligence
Figure 3 for Granite Code Models: A Family of Open Foundation Models for Code Intelligence
Figure 4 for Granite Code Models: A Family of Open Foundation Models for Code Intelligence
Viaarxiv icon

Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions

Add code
Jul 24, 2021
Figure 1 for Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions
Figure 2 for Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions
Viaarxiv icon

QUBO transformation using Eigenvalue Decomposition

Add code
Jun 19, 2021
Figure 1 for QUBO transformation using Eigenvalue Decomposition
Figure 2 for QUBO transformation using Eigenvalue Decomposition
Figure 3 for QUBO transformation using Eigenvalue Decomposition
Figure 4 for QUBO transformation using Eigenvalue Decomposition
Viaarxiv icon

Constraint Programming to Discover One-Flip Local Optima of Quadratic Unconstrained Binary Optimization Problems

Add code
Apr 04, 2021
Figure 1 for Constraint Programming to Discover One-Flip Local Optima of Quadratic Unconstrained Binary Optimization Problems
Figure 2 for Constraint Programming to Discover One-Flip Local Optima of Quadratic Unconstrained Binary Optimization Problems
Viaarxiv icon

Goal Seeking Quadratic Unconstrained Binary Optimization

Add code
Mar 24, 2021
Figure 1 for Goal Seeking Quadratic Unconstrained Binary Optimization
Figure 2 for Goal Seeking Quadratic Unconstrained Binary Optimization
Viaarxiv icon

Robust Optimization of Unconstrained Binary Quadratic Problems

Add code
Sep 21, 2017
Figure 1 for Robust Optimization of Unconstrained Binary Quadratic Problems
Figure 2 for Robust Optimization of Unconstrained Binary Quadratic Problems
Figure 3 for Robust Optimization of Unconstrained Binary Quadratic Problems
Figure 4 for Robust Optimization of Unconstrained Binary Quadratic Problems
Viaarxiv icon

Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis

Add code
May 27, 2017
Figure 1 for Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis
Figure 2 for Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis
Figure 3 for Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis
Figure 4 for Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis
Viaarxiv icon

Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems

Add code
May 26, 2017
Figure 1 for Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems
Figure 2 for Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems
Figure 3 for Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems
Figure 4 for Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems
Viaarxiv icon