Sciweavers

4325 search results - page 252 / 865
» Incremental computation with names
Sort
View
FOSSACS
2004
Springer
16 years 17 hour ago
Strong Bisimulation for the Explicit Fusion Calculus
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulati...
Lucian Wischik, Philippa Gardner
ICRA
2002
IEEE
85views Robotics» more  ICRA 2002»
15 years 11 months ago
Self-Generation by a Mobile Robot of Topological Maps of Corridors
In the present paper a system for generation of topological maps is going to be presented. This system is considered as one of the deliberative skills of the mobile robots architec...
Verónica Egido, Ramón Barber, Mar&ia...
INFOCOM
1992
IEEE
15 years 10 months ago
A Study on the Inaccessibility Characteristics of ISO 8802/4 Token-Bus LANs
Local area networks have long been established as the basis for distributed systems. Continuity of service and bounded and known message delivery latency are requirements of a num...
José Rufino, Paulo Veríssimo
LREC
2008
153views Education» more  LREC 2008»
15 years 8 months ago
Extracting and Querying Relations in Scientific Papers on Language Technology
We describe methods for extracting interesting factual relations from scientific texts in computational linguistics and language technology taken from the ACL Anthology. We use a ...
Ulrich Schäfer, Hans Uszkoreit, Christian Fed...
WSS
2001
110views Control Systems» more  WSS 2001»
15 years 8 months ago
On the Security and Vulnerability of PING
We present a formal specification of the PING protocol, and use three concepts of convergence theory, namely closure, convergence, and protection, to show that this protocol is se...
Mohamed G. Gouda, Chin-Tser Huang, Anish Arora