Sciweavers

483 search results - page 21 / 97
» Timing Games and Shared Memory
Sort
View
EELC
2006
121views Languages» more  EELC 2006»
14 years 1 months ago
Simulating Meaning Negotiation Using Observational Language Games
In this article, we study the emergence of associations between words and concepts using the self-organizing map. In particular, we explore the meaning negotiations among communica...
Tiina Lindh-Knuutila, Timo Honkela, Krista Lagus
CASES
2005
ACM
13 years 11 months ago
MTSS: multi task stack sharing for embedded systems
Out-of-memory errors are a serious source of unreliability in most embedded systems [22]. Applications run out of main memory because of the frequent difficulty of estimating the ...
Bhuvan Middha, Matthew Simpson, Rajeev Barua
DATE
2007
IEEE
106views Hardware» more  DATE 2007»
14 years 4 months ago
Optimized integration of test compression and sharing for SOC testing
1 The increasing test data volume needed to test core-based System-on-Chip contributes to long test application times (TAT) and huge automatic test equipment (ATE) memory requireme...
Anders Larsson, Erik Larsson, Petru Eles, Zebo Pen...
FORMATS
2010
Springer
13 years 7 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...
VLDB
1990
ACM
104views Database» more  VLDB 1990»
14 years 1 months ago
Hash-Based Join Algorithms for Multiprocessor Computers
This paper studies a number of hash-based join algorithms for general purpose multiprocessor computers with shared memory where the amount of memory allocated to the join operatio...
Hongjun Lu, Kian-Lee Tan, Ming-Chien Shan