Publications
Filters: First Letter Of Last Name is M [Clear All Filters]
.
2003.
.
2003.
[1514] Computing minimal siphons in Petri net models of Resource Allocation Systems: An evolutionary approach. International Workshop on Petri Nets and Software Engineering (PNSE'14).
.
2014.
[1520] Using the incidence matrix in an evolutionary algorithm for Computing minimal siphons in Petri net models. 18th International Conference on System Theory, Control and Computing (ICSTCC 2014).
.
2014.
[1455] EDCA 802.11e Performance under Different Scenarios. Quantitative Analysis. 27th International Conference on Advanced Information Networking and Applications (AINA’13).
.
2013.
[PFMBC-JCST-13] Throughput Quantitative Analysis of EDCA 802.11e in Different Scenarios. Journal of Computer Science & Technology. 13(1):16-23.
.
2013.
[MCM-SCI03] A Pattern Based Approach to Model Software Performance Using UML and Petri Nets: Application to Agent Based Systems. 9:307-313.
.
2003.
[MCM-WINET03] Analysing Internet Software Retrieval Systems: Modeling and Performance Comparison. Wireless Networks: The Journal of Mobile Communication Computation and Information. 9:223-238.
.
2003.
[MCM-JJCC-01] Web Based Versus Mobile Agent Based Software Retrieval Systems: Performance Comparison. :299-312.
.
2001.
[MCM-LNCS-01] A Performance Engineering Case Study: Software Retrieval System. 2047:317-332.
.
2001.
[MCM-MSWiM-01] Performance Analysis of Internet Based Software Retrieval Systems Using Petri Nets. :47-56.
.
2001.
[MCM-JJCC-00] Evaluating Performance on Mobile Agents Software Design. :291-307.
.
2000.
[MCM-SEPN-00] Performance Evaluation for the Design of Agent Based Systems: A Petri Net Approach. :1-20.
.
2000.
[MCM-WOSP-00] A Pattern Based Approach to Model Software Performance. :137-142.
.
2000.
[MayEHD] Effective Hausdorff dimension. Trends in Logic. 23:171-186.
.
2004.
[LutMayTPRBM] Twelve problems in resource bounded measure. :83-101.
.
2001.
[LutMayTPRBMb] Twelve problems in resource bounded measure. Bulletin of the European Association for Theoretical Computer Science. 68:64-80.
.
1999.
[AmbMay97] Resource Bounded Measure and Randomness. :1-47.
.
1997.
[HiLuMaSDNC] Scaled dimension and non uniform complexity. Journal of Computer and System Sciences. 69:97-122.
.
2004.
[DaLaLuMaFSD] Finite state dimension. Theoretical Computer Science. 310:1-33.
.
2004.
[MayKCCCHD] A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters. 84:1-3.
.
2002.
[BuhMay97] An excursion to the Kolmogorov random strings. Journal of Computer and System Sciences. 54:393-399.
.
1997.
[LutMayCVKL] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
.
1996.
[BooMay96] On the robustness of ALMOST R. Rairo Informatique Theorique et Applications. 30:123-133.
.
1996.
[MayAESET] Almost every set in exponential time is P bi immune. Theoretical Computer Science. 136:487-506.
.
1994.