Conference paper
A platform for massive agent-based simulation and its evaluation
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
The problem of finding the circular attributes in an attribute grammar is considered. Two algorithms are proposed: the first is polynomial but yields conservative results while the second is exact but is potentially exponential. It is also shown that finding the circular attributes is harder than testing circularity. © 1999 ACM.
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
David Carmel, Haggai Roitman, et al.
ACM TIST
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Joxan Jaffar
Journal of the ACM