Sciweavers

2850 search results - page 439 / 570
» On Timed Models and Full Abstraction
Sort
View
PAAPP
2006
141views more  PAAPP 2006»
15 years 22 days ago
Algorithmic optimizations of a conjugate gradient solver on shared memory architectures
OpenMP is an architecture-independent language for programming in the shared memory model. OpenMP is designed to be simple and in terms of programming abstractions. Unfortunately,...
Henrik Löf, Jarmo Rantakokko
104
Voted
IJAOSE
2010
227views more  IJAOSE 2010»
14 years 11 months ago
Implementing reactive BDI agents with user-given constraints and objectives
CASO is an agent-oriented programming language based on AgentSpeak(L), one of the most influential abstract languages based on the BDI (Beliefs-Desires-Intentions) architecture. ...
Aniruddha Dasgupta, Aditya K. Ghose
109
Voted
IPPS
2009
IEEE
15 years 7 months ago
The Weak Mutual Exclusion problem
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...
Paolo Romano, Luís Rodrigues, Nuno Carvalho
TRIDENTCOM
2008
IEEE
15 years 7 months ago
A flexible dual frequency testbed for RFID
This paper presents the setup of a testbed developed for the fast evaluation of RFID systems in two frequency domains. At the one hand the 13.56 MHz and at the other hand the 868 ...
Christoph Angerer, Martin Holzer 0002, Bastian Kne...
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 6 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi