1256 search results - page 2 / 252 » Experiences with the DEVStone benchmark |
PPSN
2010
Springer
13 years 3 months ago
2010
Springer
We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the `best' one? and the second one:...
PRL
2007
13 years 5 months ago
2007
We used the datasets of the NIPS 2003 challenge on feature selection as part of the practical work of an undergraduate course on feature extraction. The students were provided wit...
IMCSIT
2010
13 years 3 months ago
2010
The present work covers a comparison of the text retrieval qualities of open source relational databases and Lucene, which is a full text search engine library, over English docume...
AAMAS
2011
Springer
13 years 18 days ago
2011
Springer
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...
EVOW
2009
Springer
13 years 3 months ago
2009
Springer
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...