2367 search results - page 10 / 474 » An experimental analysis of self-adjusting computation |
COR
2006
13 years 8 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
This research aims to develop a model of trust and reputation that will ensure good interactions amongst software agents in large scale open systems. The following are key drivers...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The success of evolutionary algorithms (EAs) depends crucially on finding suitable parameter settings. Doing this by hand is a very time consuming job without the guarantee to ...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
SPAA
2000
ACM
14 years 23 days ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...