Sciweavers

3694 search results - page 407 / 739
» Stochastic complexity in learning
Sort
View
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
15 years 11 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
CPE
1994
Springer
170views Hardware» more  CPE 1994»
15 years 11 months ago
Automatic Scalability Analysis of Parallel Programs Based on Modeling Techniques
When implementingparallel programs forparallel computer systems the performancescalability of these programs should be tested and analyzed on different computer configurations and...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
CEC
2007
IEEE
15 years 10 months ago
Efficient relevance estimation and value calibration of evolutionary algorithm parameters
Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. The ...
Volker Nannen, A. E. Eiben
SAT
2010
Springer
158views Hardware» more  SAT 2010»
15 years 10 months ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
FGR
2004
IEEE
141views Biometrics» more  FGR 2004»
15 years 10 months ago
Smart Particle Filtering for 3D Hand Tracking
Solving the tracking of an articulated structure in a reasonable time is a complex task mainly due to the high dimensionality of the problem. A new optimization method, called Sto...
Matthieu Bray, Esther Koller-Meier, Luc J. Van Goo...