نتایج جستجو برای: infeasibility

تعداد نتایج: 687  

2007
Bo-Yin Yang Chia-Hsin Owen Chen Daniel J. Bernstein Jiun-Ming Chen

In a Eurocrypt 2006 article entitled “QUAD: A Practical Stream Cipher with Provable Security,” Berbain, Gilbert, and Patarin introduced QUAD, a parametrized family of stream ciphers. The article stated that “the security of the novel stream cipher is provably reducible to the intractability of the MQ problem”; this reduction deduces the infeasibility of attacks on QUAD from the hypothesized inf...

Journal: :J. Heuristics 2002
Massimiliano Caramia Paolo Dell'Olmo

In this paper we propose a method for integrating constraint propagation algorithms into an optimization procedure for vertex coloring with the goal of finding improved lower bounds. The key point we address is how to get instances of Constraint Satisfaction Problems (CSPs) from a graph coloring problem in order to give rise to new lower bounds outperforming the maximum clique bound. More preci...

Journal: :IFAC-PapersOnLine 2022

We propose a stochastic MPC scheme using an optimization over the initial state for predicted trajectory. Considering linear discrete-time systems under unbounded additive disturbances subject to chance constraints, we use constraint tightening based on probabilistic reachable sets design MPC. The avoids infeasibility issues arising from by including as decision variable. show that stabilizing ...

Journal: :IEEE transactions on medical robotics and bionics 2022

The upper boundary of time delay is often required in traditional telesurgery control design, which would result infeasibility across regions. To overcome this issue, paper introduces a new framework based on deep deterministic policy gradient (DDPG) reinforcement learning (RL) algorithm. developed effectively overcomes the phase difference and data loss caused by delays, facilitates restoratio...

Journal: :IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2010
Boris Alexeev Rachel Ward

We show that inverse problems with a truncated quadratic regularization are NP-hard in general to solve or even approximate up to an additive error. This stands in contrast to the case corresponding to a finite-dimensional approximation to the Mumford-Shah functional, where the operator involved is the identity and for which polynomial-time solutions are known. Consequently, we confirm the infe...

Journal: :Comput. Manag. Science 2015
Leo Liberti

In this opinion paper, I argue that “optimization and sustainable development” indicates a set of specific engineering techniques rather than a unified discipline stemming from a unique scientific principle. On the other hand, I also propose a mathematical principle underlying at least some of the concepts defining sustainability when optimizing a supply chain. The principle is based on the fac...

Journal: :Electr. Notes Theor. Comput. Sci. 2009
Moonzoo Kim Shin Hong Changki Hong Taeho Kim

Despite the growing need for customized operating system kernels for embedded devices, kernel development continues to suffer from high development and testing costs for several reasons, including the high complexity of the kernel code, the infeasibility of unit testing, exponential numbers of concurrent behaviors, and a lack of proper tool support. To alleviate these difficulties, this study p...

Journal: :Oper. Res. Lett. 2000
Markku Kallio Seppo Salo

A simple interior point method is proposed for solving a system of linear equations subject to nonnegativity constraints. The direction of update is de ned by projection of the current solution on a linear manifold de ned by the equations. Infeasibility is discussed and extension for free and bounded variables is presented. As an application, we consider linear programming problems and a compar...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید