Sciweavers

2116 search results - page 36 / 424
» On Probabilistic Alternating Simulations
Sort
View
WSC
2007
14 years 13 days ago
Finite-sample performance guarantees for one-dimensional stochastic root finding
We study the one-dimensional root finding problem for increasing convex functions. We give gradient-free algorithms for both exact and inexact (stochastic) function evaluations. ...
Samuel Ehrlichman, Shane G. Henderson
WSC
2007
14 years 14 days ago
Optimal scheduling of probabilistic repetitive projects using completed unit and genetic algorithms
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
Chachrist Srisuwanrat, Photios G. Ioannou
EC
2008
157views ECommerce» more  EC 2008»
13 years 8 months ago
The Crowding Approach to Niching in Genetic Algorithms
A wide range of niching techniques have been investigated in evolutionary and genetic algorithms. In this article, we focus on niching using crowding techniques in the context of ...
Ole J. Mengshoel, David E. Goldberg
COMPSAC
2008
IEEE
14 years 4 months ago
A Probabilistic Attacker Model for Quantitative Verification of DoS Security Threats
This work introduces probabilistic model checking as a viable tool-assisted approach for systematically quantifying DoS security threats. The proposed analysis is based on a proba...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...
ICDT
2003
ACM
132views Database» more  ICDT 2003»
14 years 3 months ago
Probabilistic Interval XML
Interest in XML databases has been growing over the last few years. In this paper, we study the problem of incorporating probabilistic information into XML databases. We propose th...
Edward Hung, Lise Getoor, V. S. Subrahmanian