Sciweavers

2950 search results - page 88 / 590
» Computing with Infinitely Many Processes
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
Distributed Resource Allocation for Synchronous Fork and Join Processing Networks
—Many emerging information processing applications require applying various fork and join type operations such as correlation, aggregation, and encoding/decoding to data streams ...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
AAAI
2007
14 years 14 hour ago
Purely Epistemic Markov Decision Processes
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...
Régis Sabbadin, Jérôme Lang, N...
DATE
2003
IEEE
97views Hardware» more  DATE 2003»
14 years 3 months ago
Enhancing Speedup in Network Processing Applications by Exploiting Instruction Reuse with Flow Aggregation
Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an op...
G. Surendra, Subhasis Banerjee, S. K. Nandy
DSE
1998
80views more  DSE 1998»
13 years 9 months ago
The Voltan application programming environment for fail-silent processes
The Voltan software library for building distributed applications provides the support for (i) a processpair to act as single Voltan self-checking ‘fail-silent’ process; and (...
Dave Black, C. Low, Santosh K. Shrivastava
ICDE
2008
IEEE
136views Database» more  ICDE 2008»
14 years 11 months ago
Processing Event-Monitoring Queries in Sensor Networks
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Vassilis Stoumpos, Antonios Deligiannakis, Yannis ...