Sciweavers

1923 search results - page 289 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
EOR
2008
88views more  EOR 2008»
14 years 10 months ago
Algorithmic analysis of the Geo/Geo/c
In this paper, we consider a discrete-time queue of Geo/Geo/c type with geometric repeated attempts. It is known that its continuous counterpart, namely the M/M/c queue with expon...
Jesus R. Artalejo, Antonis Economou, Antonio G&oac...
SIBGRAPI
2008
IEEE
15 years 4 months ago
Using Multi-agent Systems for Sampling and Rendering Implicit Surfaces
In this paper a Multi-Agent System for Sampling and Rendering Implicit Surfaces is presented (MASSRIS). Previous approaches to pen-and-ink style renderings of implicit surfaces we...
Pauline Jepp, Jörg Denzinger, Brian Wyvill, M...
CCR
2010
151views more  CCR 2010»
14 years 7 months ago
iNFAnt: NFA pattern matching on GPGPU devices
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
Niccolo Cascarano, Pierluigi Rolando, Fulvio Risso...
IEEEARES
2007
IEEE
15 years 4 months ago
Context-Dependent Access Control for Contextual Information
Abstract— Following Mark Weiser’s vision of ubiquitous computing and calm technology, computer systems should run in the background, preferably without the user noticing it at ...
Christin Groba, Stephan Grob, Thomas Springer
ATAL
2005
Springer
15 years 3 months ago
A polynomial algorithm for decentralized Markov decision processes with temporal constraints
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
Aurélie Beynier, Abdel-Illah Mouaddib