Sciweavers

269 search results - page 1 / 54
» The Quantitative Structure of Exponential Time
Sort
View
COCO
1993
Springer
78views Algorithms» more  COCO 1993»
13 years 11 months ago
The Quantitative Structure of Exponential Time
Recently Lutz [14,15] introduced a polynomial time bounded version of Lebesgue measure. He and others (see e.g. [11,13,14,15,16,17,18,20]) used this concept to investigate the quan...
Jack H. Lutz
ENTCS
2008
101views more  ENTCS 2008»
13 years 7 months ago
Model Checking Quantitative Linear Time Logic
This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains.
Marco Faella, Axel Legay, Mariëlle Stoelinga
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
13 years 11 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
COCO
2001
Springer
122views Algorithms» more  COCO 2001»
14 years 4 days ago
Hausdorff Dimension in Exponential Time
In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in line...
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, F...
AAAI
2010
13 years 7 months ago
Fast Conditional Density Estimation for Quantitative Structure-Activity Relationships
Many methods for quantitative structure-activity relationships (QSARs) deliver point estimates only, without quantifying the uncertainty inherent in the prediction. One way to qua...
Fabian Buchwald, Tobias Girschick, Eibe Frank, Ste...