Sciweavers

2208 search results - page 164 / 442
» On Issues of Instance Selection
Sort
View
EVOW
2004
Springer
15 years 9 months ago
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem
Abstract. The implementation of an evolutionary algorithm necessarily involves the selection of an appropriate set of genetic operators. For many real-world problem domains, an inc...
Wouter Boomsma
ICSOC
2004
Springer
15 years 9 months ago
Knowledge-driven interactions with services across ad hoc networks
Service oriented computing, with its aim of unhindered interoperability, is an appropriate paradigm for ad hoc networks, which are characterized by physical mobility of heterogeno...
Rohan Sen, Radu Handorean, Gruia-Catalin Roman, Gr...
CEC
2009
IEEE
15 years 8 months ago
A novel EDAs based method for HP model protein folding
— The protein structure prediction (PSP) problem is one of the most important problems in computational biology. This paper proposes a novel Estimation of Distribution Algorithms...
Benhui Chen, Long Li, Jinglu Hu
DEXAW
1999
IEEE
97views Database» more  DEXAW 1999»
15 years 8 months ago
Mining Several Data Bases with an Ensemble of Classifiers
The results of knowledge discovery in databases could vary depending on the data mining method. There are several ways to select the most appropriate data mining method dynamicall...
Seppo Puuronen, Vagan Y. Terziyan, Alexander Logvi...
SAT
2010
Springer
158views Hardware» more  SAT 2010»
15 years 7 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