23590 search results - page 361 / 4718 » Algorithm Performance Contest |
126
Voted
ISCOPE
1999
Springer
15 years 7 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
113
Voted
PPSN
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
113
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Our paper concerns optimal combinations of different types of reinsurance contracts. We introduce a novel approach based on the Mean-Variance-Criterion to solve this task. Two sta...
142
click to vote
PODC
2010
ACM
15 years 5 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
128
Voted
COLT
2008
Springer
15 years 5 months ago
2008
Springer
We design and analyze interacting online algorithms for multitask classification that perform better than independent learners whenever the tasks are related in a certain sense. W...