2588 search results - page 166 / 518 » Applications of Kolmogorov complexity to computable model th... |
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
110
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
This paper introduces a clever way of computing inner products between images in order to drastically reduce the computational complexity of fitting appearance models to images. T...
132
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
123
click to vote
ACMSE
2005
ACM
15 years 3 months ago
2005
ACM
The popularity of mobile devices has propelled the development of many useful location-aware applications. However, the heterogeneity of mobile devices necessitates that the softw...