Results 121 to 130 of about 300,721 (160)
Some of the next articles are maybe not open access.
Computational Complexity, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard Beigel, Jun Tarui
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard Beigel, Jun Tarui
openaire +2 more sources
ACC 2013 in Washington, D.C. [ACC Preview]
IEEE Control Systems, 2012The author provides an overview of the upcoming 2013 American Control Conference (ACC). ACC will be held in Washington, D.C. Monday through Wednesday, 17-19 June 2013, with workshops being planned for the Saturday and Sunday (15?16 June 2013) beforehand. The ACC is the annual conference of the American Automatic Control Council [AACC, the United States
Lucy Pao, Daniel Abramovitch
openaire +1 more source
Proceedings of the first ACM conference on Learning @ scale conference, 2014
Coding style is important to teach to beginning programmers, so that bad habits don't become permanent. This is often done manually at the University level because automated Python static analyzers cannot accurately grade based on a given rubric.
Stephanie Rogers +2 more
openaire +1 more source
Coding style is important to teach to beginning programmers, so that bad habits don't become permanent. This is often done manually at the University level because automated Python static analyzers cannot accurately grade based on a given rubric.
Stephanie Rogers +2 more
openaire +1 more source
MOLECULAR STUDIES OF ACC SYNTHASE AND ACC OXIDASE GENES IN APPLE
Acta Horticulturae, 1998The purpose of this work was to search for correlations between the rate of ethylene production during ripening of apple fruits and the molecular structure of the genes involved in its synthesis. To this end, the ethylene production of apple fruit, characterised by slow (‘Fuji’) or fast (‘Golden Delicious’) ripening, was estimated by gas chromotography.
CASTIGLIONE, STEFANO +5 more
openaire +3 more sources
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 2002
It is proved that any language in ACC can be approximately computed by two-level circuits of size 2 raised to the (log n)/sup k/ power, with a symmetric-function gate at the top and only AND gates on the first level. This implies that any language in ACC can be recognized by depth-3 threshold circuits of that size.
openaire +1 more source
It is proved that any language in ACC can be approximately computed by two-level circuits of size 2 raised to the (log n)/sup k/ power, with a symmetric-function gate at the top and only AND gates on the first level. This implies that any language in ACC can be recognized by depth-3 threshold circuits of that size.
openaire +1 more source
Possible mechanisms for the equilibrium of ACC and role of ACC deaminase-producing bacteria
Applied Microbiology and Biotechnology, 2022Sajid Ali
exaly