Mohammadreza Razzazi

This page is a disambiguation page, it actually contains mutiple papers from persons of the same or a similar name.

Bibliography

2023
Spanning simple path inside a simple polygon.
J. Supercomput., 2023

Multi-Modal Evaluation Approach for Medical Image Segmentation.
CoRR, 2023

2022
Agent-based Modeling and Simulation of Human Muscle For Development of Software to Analyze the Human Gait.
CoRR, 2022

Natural Way of Solving a Convex Hull Problem.
CoRR, 2022

Uniform Evaluation of Properties in Activity Recognition.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2022

Evaluation of Early Diagnosis of COVID-19 Algorithms.
Proceedings of the 34th IEEE International Conference on Tools with Artificial Intelligence, 2022

Multimodal Evaluation Method for Sound Event Detection.
Proceedings of the IEEE International Conference on Acoustics, 2022

2021
Web service quality of service prediction via regional reputation-based matrix factorization.
Concurr. Comput. Pract. Exp., 2021

2019
A Cloud-based solution/reference architecture for establishing collaborative networked organizations.
J. Intell. Manuf., 2019

2018
The Most Points Connected-Covering Problem with Two Disks.
Theory Comput. Syst., 2018

Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs.
Int. J. Found. Comput. Sci., 2018

Minimum Cardinality Point-to-point Connectivity Augmentation Problem.
Fundam. Informaticae, 2018

Covering with Unit Balls.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
Combinatorial filter reduction: Special cases, approximation, and fixed-parameter tractability.
J. Comput. Syst. Sci., 2017

Augmenting weighted graphs to establish directed point-to-point connectivity.
J. Comb. Optim., 2017

Analysis of a first-fit algorithm for the capacitated unit covering problem.
Int. J. Comput. Math., 2017

Finding Two Disjoint Simple Paths on Two Sets of Points is NP-Complete.
CoRR, 2017

Improper Filter Reduction.
CoRR, 2017

Inferring protein-protein interaction and protein-DNA interaction directions based on cause-effect pairs in undirected and mixed networks.
CoRR, 2017

2016
An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification.
Inf. Process. Lett., 2016

GVSEE: A Global Village Service Effort Estimator to Estimate Software Services Development Effort.
Appl. Artif. Intell., 2016

2015
Principles of Data Flow Integrity: Specification and Enforcement.
J. Inf. Sci. Eng., 2015

On capacitated covering with unit balls.
Int. J. Comput. Math., 2015

Output sensitive algorithm for covering many points.
Discret. Math. Theor. Comput. Sci., 2015

2014
A PTAS for the cardinality constrained covering with unit balls.
Theor. Comput. Sci., 2014

Balanced allocation mechanism: An optimal mechanism for multiple keywords sponsored search auctions.
Inf. Sci., 2014

An Algorithmic Framework for Solving Geometric Covering Problems - with Applications.
Int. J. Found. Comput. Sci., 2014

2012
An Improved Approximation Algorithm for the Most Points Covering Problem.
Theory Comput. Syst., 2012

An I/O cost optimal and progressive algorithm for computing massive skyline points.
Proceedings of the 2012 Proceedings of the 35th International Convention, 2012

A cellular automata based algorithm for voronoi diagram of arbitrary shapes.
Proceedings of the 2012 Proceedings of the 35th International Convention, 2012

Non-blocking N-version programming for message passing systems.
Proceedings of the 2012 Proceedings of the 35th International Convention, 2012

Non-blocking roll-forward recovery for message passing systems.
Proceedings of the 2012 Proceedings of the 35th International Convention, 2012

Preventing state divergence in duplex systems using causal memory.
Proceedings of the 2012 Proceedings of the 35th International Convention, 2012

2011
Using sticker model of DNA computing to solve domatic partition, kernel and induced path problems.
Inf. Sci., 2011

Minimum cost open chain reconfiguration.
Discret. Appl. Math., 2011

Development of core to solve the multidimensional multiple-choice knapsack problem.
Comput. Ind. Eng., 2011

Redundancy and coverage detection in wireless sensor networks in the presence of obstacles.
Proceedings of the MIPRO, 2011

An efficient algorithm to maximize the network lifetime for target coverage.
Proceedings of the MIPRO, 2011

An approach to supplier selectionin in the dynamic environment.
Proceedings of the MIPRO, 2011

2010
Planar straight-line point-set embedding of trees with partial embeddings.
Inf. Process. Lett., 2010

Drawing complete binary trees inside rectilinear polygons.
Int. J. Comput. Math., 2010

2009
Complexity of Planar Embeddability of Trees inside Simple Polygons
CoRR, 2009

Near-Optimum Folding for a Reconfigurable Snake-Like Robot.
Adv. Robotics, 2009

2008
A Linear Time Approximation Algorithm for Ruler Folding Problem.
J. Univers. Comput. Sci., 2008

Coordination of a Multi-commodity Supply Chain with Multiple Members Using Flow Networks.
Proceedings of the Second International Conference on the Digital Society (ICDS 2008), 2008

An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core.
Proceedings of the Advances in Computer Science and Engineering, 2008

2007
Unbundling Business Processes to Fine-Grained E-Services through the Next Generation EIS Frameworks.
Proceedings of the Research and Practical Issues of Enterprise Information Systems II, 2007

A New Dynamic Programming Algorithm for Orthogonal Ruler Folding Problem in d-Dimensional Space.
Proceedings of the Computational Science and Its Applications, 2007

Kinetic Convex Hull Algorithm Using Spiral Kinetic Data Structure.
Proceedings of the Selected Papers of the Fifth International Conference on, 2007

Euclidean Steiner Minimal Tree Inside Simple Polygon Avoiding Obstacles.
Proceedings of the Selected Papers of the Fifth International Conference on, 2007

2006
ISRUP E-Service Framework for agile Enterprise Architecting.
Proceedings of the Third International Conference on Information Technology: New Generations (ITNG 2006), 2006

ISRUP E-Service Framework Balanced Scorecard to Measure the Capabilities from the Methodologies, Processes, Notations, Life Cycles, and Standards.
Proceedings of the Research and Practical Issues of Enterprise Information Systems, 2006

2005
How to Draw Free Trees Inside Bounded Simple Polygons.
J. Univers. Comput. Sci., 2005

2004
How to draw free trees inside bounded rectilinear polygons.
Int. J. Comput. Math., 2004

Drawing Free Trees Inside Simple Polygons Using Polygon Skeleton.
Comput. Artif. Intell., 2004

2003
A new and practical approach to secure mobile agent server development.
Proceedings of the 2003 IEEE Wireless Communications and Networking, 2003

The Reachability Problem in a Concave Region: A New Context.
Proceedings of the Computational Science - ICCS 2003, 2003

2001
Reachability on a Region Bounded by Two Attached Squares.
Proceedings of the Computational Science - ICCS 2001, 2001

1994
On Optimal Guillotine Partitions Approximating Optimal D-box Partitions.
Comput. Geom., 1994

1991
On the generalized channel definition problem.
Proceedings of the First Great Lakes Symposium on VLSI, 1991


  Loading...