Sciweavers

1532 search results - page 113 / 307
» The Symbol Grounding Problem
Sort
View
HCI
2007
15 years 5 months ago
Cultural Usability Tests - How Usability Tests Are Not the Same All over the World
The cultural diversity of users of technology challenges our methods for usability evaluation. In this paper we report on a multi-site, cross-cultural grounded theory field study o...
Torkil Clemmensen, Qingxin Shi, Jyoti Kumar, Huiya...
DATE
2009
IEEE
92views Hardware» more  DATE 2009»
15 years 11 months ago
WCRT algebra and interfaces for esterel-style synchronous processing
—The synchronous model of computation together with a suitable execution platform facilitates system-level timing predictability. This paper introduces an algebraic framework for...
Michael Mendler, Reinhard von Hanxleden, Claus Tra...
132
Voted
MFCS
2007
Springer
15 years 10 months ago
Transition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
Christof Löding, Alex Spelten
ASIAN
1998
Springer
83views Algorithms» more  ASIAN 1998»
15 years 8 months ago
Rigid Reachability
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of ...
Harald Ganzinger, Florent Jacquemard, Margus Veane...
CEC
2007
IEEE
15 years 8 months ago
Final design interpretation of the complex-shaped beam optimizations for compliant mechanisms
Compliant mechanisms are one-piece devices that combine the features of both structures and mechanisms. Compliant mechanism design solutions were identified by using evolutionary t...
M. Sauter, T. Kern, P. Ermanni