2089 search results - page 306 / 418 » A New Problem in String Searching |
156
click to vote
GECCO
2007
Springer
16 years 14 days ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
158
click to vote
IAT
2006
IEEE
16 years 11 days ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
120
click to vote
GECCO
2005
Springer
15 years 12 months ago
2005
Springer
We propose a new methodology to look at the fitness contributions (semantics) of different schemata in Genetic Programming (GP). We hypothesize that the significance of a schem...
164
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
159
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. ...