Mohammadreza Razzazi

J. Supercomput., June, 2024

Cloud and IoT based Smart Agent-driven Simulation of Human Gait for Detecting Muscles Disorder.

[BibT_eX]

[DOI]

Sina Saadati

CoRR, 2024

Meta-Decomposition: Dynamic Segmentation Approach Selection in IoT-based Activity Recognition.

[BibT_eX]

[DOI]

CoRR, 2024

Boosting Medical Image Segmentation Performance with Adaptive Convolution Layer.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Spanning simple path inside a simple polygon.

[BibT_eX]

[DOI]

Abdolah Sepahvand

J. Supercomput., 2023

Multi-Modal Evaluation Approach for Medical Image Segmentation.

[BibT_eX]

[DOI]

CoRR, 2023

2022

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

[BibT_eX]

[DOI]

Sina Saadati

CoRR, 2022

Natural Way of Solving a Convex Hull Problem.

[BibT_eX]

[DOI]

Sina Saadati

CoRR, 2022

Uniform Evaluation of Properties in Activity Recognition.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2022

Evaluation of Early Diagnosis of COVID-19 Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Tools with Artificial Intelligence, 2022

Multimodal Evaluation Method for Sound Event Detection.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2022

2021

Web service quality of service prediction via regional reputation-based matrix factorization.

[BibT_eX]

[DOI]

Seyyed Hamid Ghafouri

Mohammad Reza Mollahoseini Ardakani

Ali Movaghar

Concurr. Comput. Pract. Exp., 2021

2019

A Cloud-based solution/reference architecture for establishing collaborative networked organizations.

[BibT_eX]

[DOI]

J. Intell. Manuf., 2019

2018

The Most Points Connected-Covering Problem with Two Disks.

[BibT_eX]

[DOI]

Sanaz Soltani

Theory Comput. Syst., 2018

Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

Minimum Cardinality Point-to-point Connectivity Augmentation Problem.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

Covering with Unit Balls.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Combinatorial filter reduction: Special cases, approximation, and fixed-parameter tractability.

[BibT_eX]

[DOI]

Fatemeh Zahra Saberifar

Jason M. O'Kane

J. Comput. Syst. Sci., 2017

Augmenting weighted graphs to establish directed point-to-point connectivity.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Analysis of a first-fit algorithm for the capacitated unit covering problem.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2017

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

[BibT_eX]

[DOI]

Abdolah Sepahvand

CoRR, 2017

Improper Filter Reduction.

[BibT_eX]

[DOI]

Fatemeh Zahra Saberifar

Jason M. O'Kane

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

2016

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

GVSEE: A Global Village Service Effort Estimator to Estimate Software Services Development Effort.

[BibT_eX]

[DOI]

Amid Khatibi Bardsiri

Appl. Artif. Intell., 2016

2015

Principles of Data Flow Integrity: Specification and Enforcement.

[BibT_eX]

[DOI]

Toktam Ramezanifarkhani

J. Inf. Sci. Eng., 2015

On capacitated covering with unit balls.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2015

Output sensitive algorithm for covering many points.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2015

2014

A PTAS for the cardinality constrained covering with unit balls.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Balanced allocation mechanism: An optimal mechanism for multiple keywords sponsored search auctions.

[BibT_eX]

[DOI]

Ali Esmaeeli

Inf. Sci., 2014

An Algorithmic Framework for Solving Geometric Covering Problems - with Applications.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

2012

An Improved Approximation Algorithm for the Most Points Covering Problem.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

An I/O cost optimal and progressive algorithm for computing massive skyline points.

[BibT_eX]

[DOI]

Mohammadmehdi Talebi

Proceedings of the 2012 Proceedings of the 35th International Convention, 2012

A cellular automata based algorithm for voronoi diagram of arbitrary shapes.

[BibT_eX]

[DOI]

Mohammadmehdi Talebi

Ali Mohammadalimaddi

Proceedings of the 2012 Proceedings of the 35th International Convention, 2012

Non-blocking N-version programming for message passing systems.

[BibT_eX]

[DOI]

Behzad Chitsaz

Proceedings of the 2012 Proceedings of the 35th International Convention, 2012

Non-blocking roll-forward recovery for message passing systems.

[BibT_eX]

[DOI]

Behzad Chitsaz

Proceedings of the 2012 Proceedings of the 35th International Convention, 2012

Preventing state divergence in duplex systems using causal memory.

[BibT_eX]

[DOI]

Behzad Chitsaz

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.

[BibT_eX]

[DOI]

Inf. Sci., 2011

Minimum cost open chain reconfiguration.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Development of core to solve the multidimensional multiple-choice knapsack problem.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2011

Redundancy and coverage detection in wireless sensor networks in the presence of obstacles.

[BibT_eX]

[DOI]

Azade Fotouhi

Proceedings of the MIPRO, 2011

An efficient algorithm to maximize the network lifetime for target coverage.

[BibT_eX]

[DOI]

Azade Fotouhi

Proceedings of the MIPRO, 2011

An approach to supplier selectionin in the dynamic environment.

[BibT_eX]

[DOI]

M. Karimi Dardashti

Mohammad Taghi Taghavifard

Proceedings of the MIPRO, 2011

2010

Planar straight-line point-set embedding of trees with partial embeddings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Drawing complete binary trees inside rectilinear polygons.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2010

2009

Complexity of Planar Embeddability of Trees inside Simple Polygons

[BibT_eX]

[DOI]

CoRR, 2009

Near-Optimum Folding for a Reconfigurable Snake-Like Robot.

[BibT_eX]

[DOI]

Adv. Robotics, 2009

2008

A Linear Time Approximation Algorithm for Ruler Folding Problem.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2008

Coordination of a Multi-commodity Supply Chain with Multiple Members Using Flow Networks.

[BibT_eX]

[DOI]

Kaveh Fayazbakhsh

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Mohammad Teshnehlab

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.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2007

Kinetic Convex Hull Algorithm Using Spiral Kinetic Data Structure.

[BibT_eX]

[DOI]

Ali Sajedi Badashian

Proceedings of the Selected Papers of the Fifth International Conference on, 2007

Euclidean Steiner Minimal Tree Inside Simple Polygon Avoiding Obstacles.

[BibT_eX]

[DOI]

Ali Asadi

Proceedings of the Selected Papers of the Fifth International Conference on, 2007

2006

ISRUP E-Service Framework for agile Enterprise Architecting.

[BibT_eX]

[DOI]

Ali Bahrami

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.

[BibT_eX]

[DOI]

Mohammad Teshnehlab

Proceedings of the Research and Practical Issues of Enterprise Information Systems, 2006

2005

How to Draw Free Trees Inside Bounded Simple Polygons.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2005

2004

How to draw free trees inside bounded rectilinear polygons.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2004

Drawing Free Trees Inside Simple Polygons Using Polygon Skeleton.

[BibT_eX]

[DOI]

Comput. Artif. Intell., 2004

2003

A new and practical approach to secure mobile agent server development.

[BibT_eX]

[DOI]

Javad Chamanara

Proceedings of the 2003 IEEE Wireless Communications and Networking, 2003

The Reachability Problem in a Concave Region: A New Context.

[BibT_eX]

[DOI]

Mohammad E. Shiri

Proceedings of the Computational Science - ICCS 2003, 2003

2001

Reachability on a Region Bounded by Two Attached Squares.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2001, 2001

1994

On Optimal Guillotine Partitions Approximating Optimal D-box Partitions.

[BibT_eX]

[DOI]

Comput. Geom., 1994

1991

On the generalized channel definition problem.

[BibT_eX]

[DOI]

Teofilo F. Gonzalez