Found 34 results
Author Keyword [ Title(Desc)] Type Year
Filters: First Letter Of Title is C  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
Tóth G, Fülöp LJenő, Vidács L, Beszédes Á, Demeter H, Farkas L, Gyimóthy T.  2010.  Complex event processing synergies with predictive analytics.
Nagy C, Vidács L, Ferenc R, Gyimóthy T, Kocsis F, Kovács I.  2011.  Complexity Measures in 4GL Environment. Computational Science and Its Applications - ICCSA 2011, Lecture Notes in Computer Science. 6786:293-309.
Turán G.  1995.  On the Complexity of Planar Boolean Circuits. Computational Complexity. 5:24–42.
Turán G, Vatan F.  1994.  On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract). FOCS. :553–564.
Turán G, Vatan F.  1997.  On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In. J. Comput. Syst. Sci.. 54:199–212.
Faragó C, Hegedüs P, Végh ÁZoltán, Ferenc R.  2014.  Connection Between Version Control Operations and Quality Change of the Source Code. {Acta Cybernetica}. 21:585–607.
Ladányi G, Hegedüs P, Ferenc R, Siket I, Gyimóthy T.  2014.  The Connection of the Bug Density and Maintainability of Classes. 8th International Workshop on Software Quality and Maintainability.
Eiben A.E, Jelasity M..  2002.  A critical note on experimental research methodology in EC. Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600). 1:582-587vol.1.
Faragó C, Hegedüs P, Ferenc R.  2015.  Cumulative Code Churn: Impact on Maintainability. Proceedings of the 15th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM). :141-150.