Sciweavers

7820 search results - page 152 / 1564
» Formalization of Time and Space
Sort
View
ENTCS
2008
110views more  ENTCS 2008»
15 years 7 months ago
Exploring an Option Space to Engineer a Ubiquitous Computing System
Engineering natural and appropriate interactive behaviour in ubiquitous computing systems presents new challenges to their developers. This paper explores formal models of interac...
Michael D. Harrison, Christian Kray, José C...
ATAL
1997
Springer
15 years 10 months ago
A Formal Specification of dMARS
The Procedural Reasoning System (PRS) is the best established agent architecture currently available. It has been deployed in many major industrial applications, ranging from fault...
Mark d'Inverno, David Kinny, Michael Luck, Michael...
ATAL
2010
Springer
15 years 8 months ago
Formalizing organizational constraints: a semantic approach
An organizational modeling language can be used to specify an agent organization in terms of its roles, organizational structure, norms, etc. Such an organizational specification ...
M. Birna van Riemsdijk, Koen V. Hindriks, Catholij...
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 7 months ago
Exact Shortest Path Queries for Planar Graphs Using Linear Space
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
Shay Mozes, Christian Sommer
184
Voted
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 11 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil