Sciweavers

3359 search results - page 200 / 672
» A Simplified Idea Algorithm
Sort
View
ICCS
2003
Springer
15 years 9 months ago
Counting Polyominoes: A Parallel Implementation for Cluster Computing
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
Iwan Jensen
CP
2006
Springer
15 years 7 months ago
Revisiting the Sequence Constraint
Many combinatorial problems, such as car sequencing and rostering, feature sequence constraints, restricting the number of occurrences of certain values in every subsequence of a g...
Willem Jan van Hoeve, Gilles Pesant, Louis-Martin ...
ECAI
2006
Springer
15 years 7 months ago
Phonetic Spelling and Heuristic Search
Abstract. We introduce a new approach to spellchecking for languages with extreme phonetic irregularities. The spelling for such languages can be significantly improved if knowledg...
Benno Stein, Daniel Curatolo
ICMLA
2007
15 years 5 months ago
Improving gene expression programming performance by using differential evolution
Gene Expression Programming (GEP) is an evolutionary algorithm that incorporates both the idea of a simple, linear chromosome of fixed length used in Genetic Algorithms (GAs) and...
Qiongyun Zhang, Chi Zhou, Weimin Xiao, Peter C. Ne...
NIPS
2003
15 years 5 months ago
Ranking on Data Manifolds
The Google search engine has enjoyed huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks....
Dengyong Zhou, Jason Weston, Arthur Gretton, Olivi...