593 search results - page 66 / 119 » An approach to benchmarking configuration complexity |
AGENTS
2001
Springer
14 years 1 months ago
2001
Springer
The First Trading Agent Competition TAC was held from June 22nd to July 8th, 2000. TAC was designed to create a benchmark problem in the complex domain of emarketplaces and to m...
ISMVL
1997
IEEE
14 years 1 months ago
1997
IEEE
In this paper, the minimization of incompletely specified multi-valued functions using functional decomposition is discussed. From the aspect of machine learning, learning sample...
EVOW
2010
Springer
14 years 4 days ago
2010
Springer
Abstract. This paper deals with the mapping of the parallel islandbased genetic algorithm with unidirectional ring migrations to nVidia CUDA software model. The proposed mapping is...
AAAI
2010
13 years 10 months ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
NIPS
2004
13 years 10 months ago
2004
Complex objects can often be conveniently represented by finite sets of simpler components, such as images by sets of patches or texts by bags of words. We study the class of posi...