Sciweavers

866 search results - page 172 / 174
» A Formal Investigation of
Sort
View
JSYML
2007
100views more  JSYML 2007»
13 years 7 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
TSE
1998
114views more  TSE 1998»
13 years 7 months ago
KLAIM: A Kernel Language for Agents Interaction and Mobility
—We investigate the issue of designing a kernel programming language for mobile computing and describe KLAIM, a language that supports a programming paradigm where processes, lik...
Rocco De Nicola, Gian Luigi Ferrari, Rosario Pugli...
TCS
2002
13 years 7 months ago
Process algebra for performance evaluation
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined...
Holger Hermanns, Ulrich Herzog, Joost-Pieter Katoe...
RE
2008
Springer
13 years 6 months ago
Generating Natural Language specifications from UML class diagrams
Early phases of software development are known to be problematic, difficult to manage and errors occurring during these phases are expensive to correct. Many systems have been deve...
Farid Meziane, Nikos Athanasakis, Sophia Ananiadou
BCSHCI
2009
13 years 5 months ago
Virtual world users evaluated according to environment design, task based and affective attention measures
This paper presents research that engages with virtual worlds for education users to understand design of these applications for their needs. An in-depth multi-method investigatio...
Breen Sweeney, Anne Adams