Sciweavers

12597 search results - page 2314 / 2520
» Complexity of Mechanism Design
Sort
View
WSC
2004
15 years 5 months ago
Building Credible Input Models
Most discrete-event simulation models have stochastic elements that mimic the probabilistic nature of the system under consideration. A close match between the input model and the...
Lawrence Leemis
LISA
2003
15 years 5 months ago
Three Practical Ways to Improve Your Network
This paper presents three simple techniques for improving network service using relatively unknown features of many existing networks. The resulting system provides greater reliab...
Kevin Miller
USITS
2003
15 years 5 months ago
Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...
MCU
1998
119views Hardware» more  MCU 1998»
15 years 5 months ago
DNA Computing Based on Splicing: Universality Results
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
Gheorghe Paun
WSC
1998
15 years 5 months ago
Input Modeling
Most discrete-event simulation models have stochastic elements that mimic the probabilistic nature of the system under consideration. A close match between the input model and the...
Lawrence Leemis
« Prev « First page 2314 / 2520 Last » Next »