Results 111 to 120 of about 1,182 (134)

Computing high-degree polynomial gradients in memory. [PDF]

Nat Commun
Bhattacharya T, Hutchinson GH, Pedretti G, Sheng X, Ignowski J, Van Vaerenbergh T, Beausoleil R, Strachan JP, Strukov DB.   +8 more
europepmc   +1 more source

Routing and Scheduling in Time-Sensitive Networking by Evolutionary Algorithms. [PDF]

Biomimetics (Basel)
Wang Z, Liao W, Xia X, Wang Z, Duan Y.
europepmc   +1 more source

Formal methods for safety-critical machine learning: a systematic literature review. [PDF]

Front Artif Intell
Newcomb A, Ochoa O.
europepmc   +1 more source

Network topology and interaction logic determine states it supports. [PDF]

NPJ Syst Biol Appl
Gedeon T.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints

European Journal of Operational Research, 2021
Artur Alves Pessôa, Anand Subramanian
exaly  

A New Method for 3-Satisfiability Problem Solving Space Structure on Structural Entropy

Symmetry, 2021
Chen Liang
exaly  

Probabilistic bounds and algorithms for the maximum satisfiability problem

Annals of Operations Research, 1989
Endre Boros, András Prékopa, Boros Endre   +2 more
exaly  

Algorithms for the maximum satisfiability problem

Computing (Vienna/New York), 1990
Pierre Hansen, Brigitte Jaumard, Hansen Pierre   +2 more
exaly  

Solving the satisfiability problem by using randomized approach

Information Processing Letters, 1992
C Y Tang
exaly