Sciweavers

1578 search results - page 163 / 316
» Algorithmic randomness of continuous functions
Sort
View
HYBRID
2003
Springer
15 years 7 months ago
Reachability Analysis of Nonlinear Systems Using Conservative Approximation
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
Eugene Asarin, Thao Dang, Antoine Girard
128
Voted
GECCO
2004
Springer
100views Optimization» more  GECCO 2004»
15 years 7 months ago
Analysis of the (1+1) EA for a Noisy OneMax
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...
Stefan Droste
EOR
2006
103views more  EOR 2006»
15 years 2 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 9 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
ICANNGA
2007
Springer
161views Algorithms» more  ICANNGA 2007»
15 years 6 months ago
Evolutionary Induction of Decision Trees for Misclassification Cost Minimization
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
Marek Kretowski, Marek Grzes