Sciweavers

2266 search results - page 112 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
15 years 7 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
ECCV
2000
Springer
16 years 3 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
115
Voted
WABI
2009
Springer
128views Bioinformatics» more  WABI 2009»
15 years 8 months ago
Improving Inference of Transcriptional Regulatory Networks Based on Network Evolutionary Models
Abstract. Computational inference of transcriptional regulatory networks remains a challenging problem, in part due to the lack of strong network models. In this paper we present e...
Xiuwei Zhang, Bernard M. E. Moret
ICALP
2005
Springer
15 years 7 months ago
Linear Time Algorithms for Clustering Problems in Any Dimensions
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
Amit Kumar, Yogish Sabharwal, Sandeep Sen
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
15 years 3 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova