Sciweavers

164 search results - page 26 / 33
» Rewriting Extended Regular Expressions
Sort
View
TPLP
2008
89views more  TPLP 2008»
13 years 8 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
DSL
2009
13 years 6 months ago
Operator Language: A Program Generation Framework for Fast Kernels
Abstract. We present the Operator Language (OL), a framework to automatically generate fast numerical kernels. OL provides the structure to extend the program generation system Spi...
Franz Franchetti, Frédéric de Mesmay...
MA
2000
Springer
135views Communications» more  MA 2000»
14 years 5 days ago
Principles of Mobile Maude
Mobile Maude is a mobile agent language extending the rewriting logic language Maude and supporting mobile computation. Mobile Maude uses reflection to obtain a simple and general ...
Francisco Durán, Steven Eker, Patrick Linco...
IJCAI
2007
13 years 10 months ago
Towards Runtime Behavior Adaptation for Embodied Characters
Typically, autonomous believable agents are implemented using static, hand-authored reactive behaviors or scripts. This hand-authoring allows designers to craft expressive behavio...
Peng Zang, Manish Mehta, Michael Mateas, Ashwin Ra...
DATE
2005
IEEE
133views Hardware» more  DATE 2005»
14 years 2 months ago
Compiler-Based Approach for Exploiting Scratch-Pad in Presence of Irregular Array Access
Scratch-pad memory is becoming an important fixture in embedded multimedia systems. It is significantly more efficient than the cache, in performance and power, and has the add...
Mohammed Javed Absar, Francky Catthoor