5580 search results - page 328 / 1116 » Randomized priority algorithms |
143
click to vote
WG
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
167
click to vote
GECCO
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. This work introduces a new evolutionary algorithm that adapts the operator probabilities (rates) while evolves the solution of the problem. Each individual encodes its ge...
178
click to vote
MFCS
2004
Springer
16 years 7 days ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
169
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
199
click to vote
COLT
2005
Springer
16 years 12 days ago
2005
Springer
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...