Sciweavers

2354 search results - page 130 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ISAAC
2004
Springer
107views Algorithms» more  ISAAC 2004»
14 years 2 months ago
On the Hardness and Easiness of Random 4-SAT Formulas
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
Andreas Goerdt, André Lanka
CVIU
2006
76views more  CVIU 2006»
13 years 9 months ago
Homeostatic image perception: An artificial system
This paper describes how a visual system can automatically define features of interest from the observation of a large enough number of natural images. The principle complements t...
Thomas Feldman, Laurent Younes
BMCBI
2006
179views more  BMCBI 2006»
13 years 9 months ago
Multiscale Hy3S: Hybrid stochastic simulation for supercomputers
Background: Stochastic simulation has become a useful tool to both study natural biological systems and design new synthetic ones. By capturing the intrinsic molecular fluctuation...
Howard Salis, Vassilios Sotiropoulos, Yiannis N. K...
HYBRID
2004
Springer
14 years 2 months ago
Stochastic Hybrid Systems: Application to Communication Networks
We propose a model for Stochastic Hybrid Systems (SHSs) where transitions between discrete modes are triggered by stochastic events much like transitions between states of a contin...
João P. Hespanha
WSC
2000
13 years 10 months ago
Simulation optimization of stochastic systems with integer variables by sequential linearization
Discrete-event simulation is widely used to analyse and improve the performance of manufacturing systems. The related optimization problem often includes integer design variables ...
S. J. Abspoel, L. F. P. Etman, J. Vervoort, J. E. ...