#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2007

2012

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Ali Nourollah, Mohammadreza Razzazi
- J. UCS
- 2008

A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. " Ruler Folding Problem " , which is NP-Complete is to find the minimum length of the folded chain. The best linear approximation algorithm for it were proposed by Hopcroft et al. Their… (More)

- Ali Nourollah, Mohammadreza Razzazi
- ICCSA
- 2007

- Elham Pashaei, A. Nourollah, A. Bagheri
- 2012 IEEE International Conference on Computer…
- 2012

The Steiner problem leads to solutions in several scientific and business applications. Computer networks routing and electronic integrated circuits are few examples of it. Assuming some points in the Euclidean plane, we can construct a minimum spanning tree connecting these (terminal) nodes. It is possible to add some extra points (Steiner Points) in order… (More)

Pseudo-triangulation is regarded as one of the most commonly used problems in computational geometry. In this paper we consider the problem of minimum pseudo-triangulation of a given set of points S in the plane using convex hull layers and we propose two new methods that will lead to the production of minimum pseudo-triangulation. This means that the… (More)

- Farhad Ranjbar Helan, Ali Nourollah
- 2010 International Conference on Wireless…
- 2010

Similar to many technological developments, wireless sensor networks have emerged from military needs and found its way into civil applications. Today wireless sensor networks has become a key technology for different kinds of smart environments and an intense research effort is currently underway to enable the application of wireless sensor networks for a… (More)

- Ali Nourollah, Mohammadreza Razzazi
- Discrete Applied Mathematics
- 2011

- Elnaz Pashaei, Ali Nourollah, Mohammad Reza Meybodi
- 2012 IEEE International Conference on Computer…
- 2012

The minimum Steiner tree problem, a classical combinatorial optimization problem with a long history, is a NP-complete problem. Due to its wide application, study of heuristic algorithm about Steiner tree problem has important practical and theoretical significance. In this paper, we introduce a new heuristic algorithm based on Sollin's algorithm for… (More)

- Ali Nourollah, Mohammadreza Razzazi
- Advanced Robotics
- 2009

- A. Nourollah
- 2011

and computational geometry is the generation of random polygons. practical evaluation of algorithms that operate on polygons, where it is necessary to check determine the actual CPU experimentally. To this time, no polynomial known for the random generation of polygons with a uniform distribution presented for generating random polygons using a set of… (More)

Minimum Steiner tree problem in a weighted graph is to find a least cost sub tree in the graph such that it contains special vertices called terminal points. Since this problem belongs to NP-Complete problems, many approximate algorithms including genetic algorithms and ant colony strategies have been designed for solving it. In this paper, we propose an… (More)