Sciweavers

210 search results - page 30 / 42
» Fast Global Optimization of Curvature
Sort
View
CEC
2007
IEEE
14 years 1 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
14 years 1 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
CGO
2006
IEEE
14 years 1 months ago
Tailoring Graph-coloring Register Allocation For Runtime Compilation
Just-in-time compilers are invoked during application execution and therefore need to ensure fast compilation times. Consequently, runtime compiler designers are averse to impleme...
Keith D. Cooper, Anshuman Dasgupta
GECCO
2004
Springer
14 years 27 days ago
Towards a Generally Applicable Self-Adapting Hybridization of Evolutionary Algorithms
When applied to real-world problems, the powerful optimization tool of Evolutionary Algorithms frequently turns out to be too time-consuming due to elaborate fitness calculations t...
Wilfried Jakob, Christian Blume, Georg Bretthauer
ECML
2007
Springer
13 years 9 months ago
Sequence Labeling with Reinforcement Learning and Ranking Algorithms
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
Francis Maes, Ludovic Denoyer, Patrick Gallinari