304 search results - page 40 / 61 » Exploiting problem structure in a genetic algorithm approach... |
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
IJCV
2008
13 years 7 months ago
2008
Abstract There are billions of photographs on the Internet, comprising the largest and most diverse photo collection ever assembled. How can computer vision researchers exploit thi...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Parallel computation of the adaptive lattice filtering algorithm is difficult due to the dependency problem caused by feedback operations. The conventional control-level paralle...
CGF
2008
13 years 8 months ago
2008
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
RIAO
2007
2007
From Layout to Semantic: a Reranking Model for Mapping Web Documents to Mediated XML Representations
13 years 9 months ago
Many documents on the Web are formated in a weakly structured format. Because of their weak semantic and because of the heterogeneity of their formats, the information conveyed by...