Results 211 to 220 of about 13,120 (267)
Some of the next articles are maybe not open access.

Related searches:

Flat Arbiters

Fundamenta Informaticae, 2009
A new way of constructing N-way arbiters is proposed. The main idea is to perform arbitrations between all pairs of requests, and then make decision on what grant to issue based on their outcomes. Crucially, all the mutual exclusion elements in such an arbiter work in parallel. This ‘flat’ arbitration is prone to new threats such as formation of cycles
Andrey Mokhov   +2 more
openaire   +1 more source

Flat Minima

Neural Computation, 1997
We present a new algorithm for finding low-complexity neural networks with high generalization capability. The algorithm searches for a “flat” minimum of the error function. A flat minimum is a large connected region in weight space where the error remains approximately constant.
Hochreiter, Sepp, Schmidhuber, Jürgen
openaire   +3 more sources

Flat and weakly flat projection algebras

Algebra Universalis, 2002
The concept of a projection algebra was introduced by \textit{H.\ Ehrig} and his collaborators as an algebraic version of ultrametric spaces. This concept is useful in computer science as a convenient tool for algebraic specification of process algebras. By \(\mathcal{PRO}\) is denoted the category of projection algebras.
Ebrahimi, M. Mehdi, Mahmoudi, M.
openaire   +1 more source

Flat Frog

ACM SIGGRAPH 2012 Computer Animation Festival, 2012
Flat Frog is based on the misadventures of two rustic frogs that are always anxious to cross the road in search of females. Ever the ignorant optimists, the two rubes manage to get run over again and again out on the road but this never seems to dampen.
openaire   +1 more source

Home - About - Disclaimer - Privacy