Sciweavers

5326 search results - page 147 / 1066
» On what we can ensure
Sort
View
WSC
2007
15 years 8 months ago
Determining efficient simulation run lengths for real time decision making
Suppose that there are a number of alternative ways of operating a system, and a performance measure is available for comparing them. Simulation runs can be carried out to estimat...
Russell C. H. Cheng
CONCUR
2010
Springer
15 years 7 months ago
Termination in Impure Concurrent Languages
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
ADBIS
1997
Springer
103views Database» more  ADBIS 1997»
15 years 10 months ago
Admissible Record-Oriented Evaluation Plans for Declarative Updates
Efficient evaluation strategies for declarative updates have rarely been investigated. Due to possible dependencies between the resulting database state and the order in which re...
Gisela Fischer, Karl Aberer
ENTCS
2006
134views more  ENTCS 2006»
15 years 6 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
ICC
2007
IEEE
101views Communications» more  ICC 2007»
16 years 22 days ago
On the Limitations of Random Sensor Placement for Distributed Signal Detection
— We consider the design of a sensor network for detecting an emitter who if present is known to be located in an interval but whose exact position is unknown. We seek to minimiz...
Zhenyu Tu, Rick S. Blum