#### Filter Results:

- Full text PDF available (25)

#### Publication Year

1999

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki
- Theory of Computing
- 2010

We investigate the role of nondeterminism in Winfree's abstract tile assembly model, which was conceived to model artificial molecular self-assembling systems constructed from DNA. By nondeterminism we do not mean a magical ability such as that possessed by a nondeterministic algorithm to search an exponential-size space in polynomial time. Rather, we study… (More)

- Manuela M. Veloso, Tucker R. Balch, +12 authors Ehsan Chiniforooshan
- AI Magazine
- 2002

in Osaka. RoboCup is a research-oriented initiative that pioneered the field of multirobot research of robot teams starting in 1996. In those days, most of the robotics research was focused on single-robot issues. RoboCup opened a new horizon for multirobot research: Teams of robots need to face other teams of robots to accomplish specific goals. This… (More)

- Ehsan Chiniforooshan, Mark Daley, Oscar H. Ibarra, Lila Kari, Shinnosuke Seki
- Theor. Comput. Sci.
- 2011

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a b s t r a c t We investigate the power of (1-reversal) counter machines (finite… (More)

- Ehsan Chiniforooshan, Vasek Chvátal
- Discrete Mathematics & Theoretical Computer…
- 2011

De Bruijn and Erd˝ os proved that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvátal suggested a possible generalization of this theorem in the framework of metric spaces. We provide partial results in this direction.

Constructing soccer robots is an attempt in development of AI researches, done by defining a standard problem and solving it by many researchers all over the world. In this field, every year a formal federation holds international competitions, called RoboCup [1]. The Simulation League is one of the branches of the RoboCup. We have designed and implemented… (More)

- Peyman Afshani, Ehsan Chiniforooshan, +4 authors Hamid Zarrabi-Zadeh
- COCOON
- 2007

We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, we make a few assumptions which allow us to obtain an algorithm with the worst case query complexity of O(k) + 2k log n k in which k is the number of vertices adjacent to… (More)

- Laurent Beaudou, John Adrian Bondy, +5 authors Yori Zwols
- Electr. J. Comb.
- 2015

8 Abstract A special case of a combinatorial theorem of De Bruijn and Erd˝ os asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvátal suggested a possible generalization of this assertion in metric spaces with appropriately defined lines. We prove this generalization in all metric spaces induced by… (More)

- Mansour Jamzad, Sayyed Bashir Sadjad, +5 authors Ehsan Chiniforooshan
- RoboCup
- 2001

A mobile robot should be able to analyze what it is seeing in real time rate and decide accordingly. Fast and reliable analysis of image data is one of the key points in soccer robot performance. In this paper we suggest a very fast method for object finding which uses the concept of perspective view. In our method, we introduce a set of jump points in… (More)

- Ehsan Chiniforooshan
- Journal of Graph Theory
- 2008

- Anthony Bonato, Ehsan Chiniforooshan, Pawel Pralat
- Theor. Comput. Sci.
- 2010

Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where the cops win if at least one of them is of distance at most k from the robber in G. The cop number of a graph G is the minimum number of cops needed to capture the robber in G. The… (More)