To tackle problems that can not be solved by current digital computers, many systems propose ideas from physics and neuroscience. The CTDS solver introduced by ErcseyRavasz and Toroczkai is one of such system. It solves the satisfiability problem by reducing it to a minimization of a timevarying target function. Although the possibility of an efficient electric circuit implementation of the solver has been shown, in terms of physical realizations, the solver has a problem of unbounded variations of the target function parameters. Here we propose a variant of the solver with bounded target function parameters. It includes several possible modificationsmore »
Bounded ContinuousTime Satisfiability Solver
To tackle problems that can not be solved by current digital computers, many systems propose ideas from physics and neuroscience. The CTDS solver introduced by ErcseyRavasz and Toroczkai is one of such system. It solves the satisfiability problem by reducing it to a minimization of a timevarying target function. Although the possibility of an efficient electric circuit implementation of the solver has been shown, in terms of physical
realizations, the solver has a problem of unbounded variations of the target function parameters. Here we propose a variant of the solver with bounded target function parameters. It includes several possible modifications of the solver in system parameter differences. We also show the basic characteristics of the solver, the upper and lower bounds of the target function parameters.
 Publication Date:
 NSFPAR ID:
 10163758
 Journal Name:
 International Symposium on Nonlinear Theory and its Applications (NOLTA2019)
 Page Range or eLocationID:
 436439
 Sponsoring Org:
 National Science Foundation
More Like this


Appeared in the proceedings of the 2021 IFAC Workshop on TimeDelay Systems This paper establishes a PIE (Partial Integral Equation)based technique for the robust stability and H∞ performance analysis of linear systems with interval delays. The delays considered are timeinvariant but uncertain, residing within a bounded interval excluding zero. We first propose a structured class of PIE systems with parametric uncertainty, then propose a Linear PI Inequality (LPI) for robust stability and H∞ performance of PIEs with polytopic uncertainty. Next, we consider the problem of robust stability and H∞ performance of multidelay systems with interval uncertainty in the delay parametersmore »

Problem definition: Inspired by new developments in dynamic spectrum access, we study the dynamic pricing of wireless Internet access when demand and capacity (bandwidth) are stochastic. Academic/practical relevance: The demand for wireless Internet access has increased enormously. However, the spectrum available to wireless service providers is limited. The industry has, thus, altered conventional licensebased spectrum access policies through unlicensed spectrum operations. The additional spectrum obtained through these operations has stochastic capacity. Thus, the pricing of this service by the service provider has novel challenges. The problem considered in this paper is, therefore, of high practical relevance and new to themore »

This paper studies the distributed linearly separable computation problem, which is a generalization of many existing distributed computing problems such as distributed gradient coding and distributed linear transform. A master asks N distributed workers to compute a linearly separable function of K datasets, which is a set of Kc linear combinations of K equallength messages (each message is a function of one dataset). We assign some datasets to each worker in an uncoded manner, who then computes the corresponding messages and returns some function of these messages, such that from the answers of any Nr out of N workers themore »

Variational Quantum Algorithms (VQA) are one of the most promising candidates for nearterm quantum advantage. Traditionally, these algorithms are parameterized by rotational gate angles whose values are tuned over iterative execution on quantum machines. The iterative tuning of these gate angle parameters make VQAs more robust to a quantum machine’s noise profile. However, the effect of noise is still a significant detriment to VQA’s target estimations on real quantum machines — they are far from ideal. Thus, it is imperative to employ effective error mitigation strategies to improve the fidelity of these quantum algorithms on nearterm machines.While existing error mitigationmore »