Sciweavers

1686 search results - page 165 / 338
» Programs as polygraphs: computability and complexity
Sort
View
110
Voted
ARTS
1997
Springer
15 years 7 months ago
The Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
Sérgio Vale Aguiar Campos, Edmund M. Clarke
121
Voted
SIGCSE
2009
ACM
114views Education» more  SIGCSE 2009»
16 years 4 months ago
Engaging students through mobile game development
This paper describes using mobile game development as a motivational tool to engage students early in the curriculum. Mobile devices have become an integral part of everyday lives...
Stan Kurkovsky
126
Voted
ERSA
2008
145views Hardware» more  ERSA 2008»
15 years 5 months ago
Multicore Devices: A New Generation of Reconfigurable Architectures
For two decades, reconfigurable computing systems have provided an attractive alternative to fixed hardware solutions. Reconfigurable computing systems have demonstrated the low c...
Steven A. Guccione
141
Voted
PDP
2002
IEEE
15 years 8 months ago
The CDAG: A Data Structure for Automatic Parallelization for a Multithreaded Architecture
Despite the explosive new interest in Distributed Computing, bringing software — particularly legacy software — to parallel platforms remains a daunting task. The Self Distrib...
Bernd Klauer, Frank Eschmann, Ronald Moore, Klaus ...
147
Voted
AGP
1994
IEEE
15 years 7 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari