Sciweavers

3663 search results - page 486 / 733
» Problems in the ontology of computer programs
Sort
View
USM
2000
15 years 10 months ago
Trade-offs in a Secure Jini Service Architecture
Jini is an infrastructure built on top of the mobile code facilities of the Java programming language enabling clients and services to spontaneously engage in arbitrary usage scena...
Peer Hasselmeyer, Roger Kehr, Marco Voß
ASM
2008
ASM
15 years 8 months ago
On the Purpose of Event-B Proof Obligations
Event-B is a formal modelling method which is claimed to be suitable for diverse modelling domains, such as reactive systems and sequential program development. This claim hinges o...
Stefan Hallerstede
GAMEON
2007
15 years 8 months ago
Teaching AI Concepts by Using Casual Games: A Case Study
Nowadays it is not uncommon for computer games to be used as tools to help introduce basic computer science concepts. In this paper we argue that games could also be used in more ...
Cesar Tadeu Pozzer, Börje Karlsson
DM
2008
139views more  DM 2008»
15 years 6 months ago
On domination and reinforcement numbers in trees
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetn...
CORR
2006
Springer
103views Education» more  CORR 2006»
15 years 6 months ago
Pants Decomposition of the Punctured Plane
A pants decomposition of an orientable surface is a collection of simple cycles that partition into pants, i.e., surfaces of genus zero with three boundary cycles. Given a set P...
Sheung-Hung Poon, Shripad Thite