Sciweavers

4555 search results - page 344 / 911
» Deductive Algorithmic Knowledge
Sort
View
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
16 years 26 days ago
Improving the human readability of features constructed by genetic programming
The use of machine learning techniques to automatically analyse data for information is becoming increasingly widespread. In this paper we examine the use of Genetic Programming a...
Matthew Smith, Larry Bull
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
16 years 26 days ago
A multimodal particle swarm optimizer based on fitness Euclidean-distance ratio
One of the most critical issues that remains to be fully addressed in existing multimodal evolutionary algorithms is the difficulty in pre-specifying parameters used for estimatin...
Xiaodong Li
BROADNETS
2005
IEEE
16 years 10 days ago
Performance analysis and enhancement for backbone based wireless mobile ad hoc networks
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...
Laura Huei-jiun Ju, Izhak Rubin
STACS
2005
Springer
16 years 6 days ago
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
Abraham Flaxman, Bartosz Przydatek
CP
2004
Springer
16 years 3 days ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore