Results 61 to 70 of about 970,483 (277)

On the bounded integer programming [PDF]

2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies, 2008
The best upper time bound for solving the bounded integer programming (BIP) up to now is poly(phi) ldr n2n+o(n), where n and phi are the dimension and the input size of the problem respectively. In this paper, we show that BIP is solvable in deterministic time poly(phi) ldr nn+o(n).
openaire   +1 more source

Memristive‐Gated RC‐Delay Synaptic Transistors for Time‐Encoded Analog in‐Memory Computing

Advanced Functional Materials, EarlyView.
A Memristive‐Gated Transistor for Time‐Encoded Analog In‐Memory Computing — By exploiting the RC delay of a self‐rectifying interface‐type memristor, nonlinear I–V distortion is structurally bypassed, enabling 3‐bit nonvolatile memory, spike‐timing‐based analog encoding, and hardware‐calibrated reservoir‐computing validation within a unified device ...
Yun‐Seo Shin, Eunjoo Yoo, Ki‐Hoon Son, Hyun‐Sik Kim, Dae‐Hee Han, Jeong Hyeon Son, Seung Hwan Lee, Hong‐Sub Lee   +7 more
wiley   +1 more source

Development of Mathematic Learning Set Based On Pedagogical Content Knowledge to Improve Mathematics Problem Solving Ability

Journal of Medives: Journal of Mathematics Education IKIP Veteran Semarang, 2021
This research use development research wich aim to product mathematic learning that include implementation plans and woksheets based on pedagogical content knowledge in order to improve mathematical problem solving ability.
Ibut Priono Leksono, Sri Rahmawati Fitriatien   +1 more
doaj   +1 more source

Ground‐State Charge‐Transfer Doping in Donor–Acceptor Semiconducting Polymers

Advanced Functional Materials, EarlyView.
This work demonstrates controlled ground‐state charge‐transfer complex formation (GS‐CTC) and doping in a series of diketopyrrolopyrrole‐based donor–acceptor semiconducting polymers paired with a π‐conjugated penta‐t‐butylpentacyanopentabenzo[25]annulene “cyanostar” macrocycle. Complementary experimental techniques show how subtle molecular, electronic,
Tanner L. Smith, Akshay N. Shah, Tanya A. Balandin, Michel De Keersmaecker, Paramasivam Mahalingam, Debapriya Gupta, Siqi Yu, Eui Hyun Suh, Pushkar Dalal, Erin L. Ratcliff, Scott P. O. Danielsen, Tse Nga Ng, Amar H. Flood, Jason D. Azoulay   +13 more
wiley   +1 more source

A Novel Reduced-Order Analytical Fault Diagnosis Model for Power Grid

IEEE Access
Power grid fault diagnosis methods based on analytical models possess advantages such as logical rigor, strong interpretability, and high applicability.
Zhuonan Lin, Yongxing Wang, Haoqian Xu, Fanrong Wei   +3 more
doaj   +1 more source

Non-convex mixed-integer nonlinear programming : a survey [PDF]

, 2012
A wide range of problems arising in practical applications can be formulated as Mixed-Integer Nonlinear Programs (MINLPs). For the case in which the objective and constraint functions are convex, some quite effective exact and heuristic algorithms are ...
Burer, S, Letchford, Adam, Adam N. Letchford, Samuel Burer   +3 more
core   +4 more sources

Controlling Radiative Phonons in the van der Waals Ferroelectric NbOI2

Advanced Materials, EarlyView.
Using a simple mirror geometry, this work demonstrates local‐density‐of‐optical‐states control of THz phonon emission in van der Waals ferroelectric NbOI2. By engineering the photonic environment, the phonon Q‐factor, linewidth, peak frequency, and emission intensity are reversibly tuned by over an order of magnitude, revealing radiative phonons as ...
Baolong Zhang, Ruihuan Duan, Sobhan Subhra Mishra, Thomas Tan Caiwei, Zheng Liu, Ranjan Singh   +5 more
wiley   +1 more source

A New Nonparametric Filled Function Method for Integer Programming Problems with Constraints

Mathematics, 2022
In this paper, we investigate and develop a new filled function method for solving integer programming problems with constraints. By adopting the appropriate equivalent transformation method, these problems are transformed into a class of box-constrained
Suxia Ma, Yuelin Gao, Bo Zhang, Wenlu Zuo   +3 more
doaj   +1 more source

The Graver Complexity of Integer Programming [PDF]

Annals of Combinatorics, 2009
Improved Bound $\Omega(2^m)$
Yael Berstein, Shmuel Onn
openaire   +3 more sources

FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Programming Solver [PDF]

, 1999
We describe FATCOP, a new parallel mixed integer program solver written in PVM. The implementation uses the Condor resource management system to provide a virtual machine composed of otherwise idle computers.
Chen, Qun, Ferris, Michael
core