Publications

Export 98 results:
[ Author(Desc)] Title Type Year
Filters: First Letter Of Last Name is B  [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 
B
Bilicki V, Béládi R.  2007.  A novel approach for distributed Management and Monitoring of Wireless Mesh Networks. Proceedings of the Regional Conference on Embedded and Ambient Systems (RCEAS 2007). :Paper46.
Bilicki V.  2012.  Mobil telefon alapú személyi egyszségtár egy K+F projektben.
Bilicki V, Kasza M, Szűcs V, Molnár G.  2009.  Homokháti Small Area Living Lab Benefiting The Agricultural Sector In Hungary. eJOV. 11:83-100.
Bilicki V, Béládi R.  2010.  Monitoring the Quality of Service in Wireless Mesh Networks Consumption Aspect.
Bilicki V, Kállai T, Kasza M.  2007.  Wireless Mesh Network For Rural Communities. AVA 3 International Conference on Agricultural Ekonomics , Rural Development and Informatics. :237-247.
Bilicki V.  2012.  Topológia felderítés hibrid hálózatokban.
Bilicki V, Végh ÁZ, Szűcs V.  2011.  Klinikai döntéstámogató rendszerek és a Telemedicina. IME : Informatika és menedzsment az egészségügyben. X:50-54.
Bilicki V, Rak Z.  2010.  Wireless Mesh Networks from the Energy Consumption Aspect.
Binkley D, Danicic S, Gyimóthy T, Harman M, Kiss Á, Korel B.  2005.  Minimal Slicing and the Relationships between Forms of Slicing. Proceedings of the 5th {IEEE} International Workshop on Source Code Analysis and Manipulation ({SCAM} 2005). :45–54.
Binkley D, Danicic S, Gyimóthy T, Harman M, Kiss Á, Korel B.  2006.  Theoretical Foundations of Dynamic Program Slicing. Theoretical Computer Science. 360:23–41.
Binkley D, Danicic S, Gyimóthy T, Harman M, Kiss Á, Ouarbya L.  2004.  Formalizing Executable Dynamic and Forward Slicing. Proceedings of the 4th IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2004). :43–52.
Binkley D, Danicic S, Gyimóthy T, Harman M, Kiss Á, Korel B.  2006.  A Formalisation of the Relationship between Forms of Program Slicing. Science of Computer Programming. 62:228–252.
Binkley D, Beszédes Á, Islam S, Jász Judit, la Vancsics B.  2015.  Uncovering Dependence Clusters and Linchpin Functions. Proceedings of the 31th IEEE International Conference on Software Maintenance and Evolution (ICSME'15). :141-150.
Blázsik Z, Holló C., Imreh C., Kovács Z.  2001.  Heuristics for the PNS problem. Optimization theory: Recent development from Mátraháza. :1-18.
Blázsik Z, Holló C., Imreh B.  1999.  Kiszámolható korlátok speciális PNS-problémaosztályok lehetséges megoldásainak a számára. :182-194.
Blázsik Z, Holló C., Imreh B, Imreh C., Kovács Z.  2000.  On a well solvable class of the PNS problem. Novi Sad Journal of Mathematics. 30:21-30.
Blázsik Z, Holló C., Imreh B.  1998.  Explicit bounds for the number of feasible solutions of special PNS-problem classes. Pure Mathematics and Applications. 9:17-27.
Blázsik Z, Holló C., Imreh B, Imreh C., Kovács Z.  2000.  On bottleneck and k-sum versions of the Process Network Synthesis problems. Novi Sad Journal of Mathematics. 30:11-19.
Blázsik Z, Holló C., Imreh B.  1998.  On Decision-Mappings Related to Process Network Synthesis Problem. Acta Cybernetica. 13:319-328.
Bognár S, Gergely Tamás, Rácz R, Beszédes Á, Marinkovic V.  2013.  Code Coverage Measurement Framework for Android Devices. Proceedings of the 13th Symposium on Programming Languages and Software Tools, SPLST'13. :46–60.
Bohus M, Bilicki V.  2005.  LanStore: egy elosztott, megbízható fájl tároló rendszer. Networkshop 2005. :Paper156.
van den Brand MGJ, Canfora G, Gyimóthy T.  2004.  Seventh European Conference on Software Maintenance and Reengineering (CSMR 2003). Journal of Software Maintenance and Evolution: Research and Practice. 16:217–218.
Brandic I, Emeakaroha VC, Maurer M, Dustdar S, Acs S, Kertész Attila, Kecskeméti G.  2010.  LAYSI: A Layered Approach for SLA-Violation Propagation in Self-Manageable Cloud Infrastructures. Computer Software and Applications Conference Workshops (COMPSACW), 2010 IEEE 34th Annual. :365-370.