Sciweavers

2626 search results - page 154 / 526
» The complexity of stochastic sequences
Sort
View
ICCMS
2009
118views more  ICCMS 2009»
15 years 4 months ago
Optimized Parallel Implementation of Gillespie's First Reaction Method on Graphics Processing Units
The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochas...
Cristian Dittamo, Davide Cangelosi
AUTOMATICA
2011
15 years 1 months ago
A frequentist approach to mapping under uncertainty
An asynchronous stochastic approximation based (Frequentist) approach is proposed for mapping using noisy mobile sensors under two different scenarios: 1) perfectly known sensor ...
Suman Chakravorty, R. Saha
JSAC
2011
100views more  JSAC 2011»
14 years 9 months ago
Scheduling for Optimal Rate Allocation in Ad Hoc Networks With Heterogeneous Delay Constraints
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
Juan José Jaramillo, R. Srikant, Lei Ying
WSC
1998
15 years 7 months ago
Rostering by Iterating Integer Programming and Simulation
We present a new technique (RIIPS) for solving rostering problems in the presence of service uncertainty. RIIPS stands for "Rostering by Iterating Integer Programming and Sim...
Shane G. Henderson, Andrew J. Mason
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 6 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking