Sciweavers

94 search results - page 6 / 19
» Generation of Tree Decompositions by Iterated Local Search
Sort
View
AAAI
2000
13 years 9 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
ICAPR
2009
Springer
14 years 7 days ago
Multisensor Biometric Evidence Fusion for Person Authentication Using Wavelet Decomposition and Monotonic-Decreasing Graph
—This paper presents a novel biometric sensor generated evidence fusion of face and palmprint images using wavelet decomposition for personnel identity verification. The approach...
Dakshina Ranjan Kisku, Jamuna Kanta Sing, Massimo ...
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
14 years 1 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
BMCBI
2008
138views more  BMCBI 2008»
13 years 7 months ago
Methods for simultaneously identifying coherent local clusters with smooth global patterns in gene expression profiles
Background: The hierarchical clustering tree (HCT) with a dendrogram [1] and the singular value decomposition (SVD) with a dimension-reduced representative map [2] are popular met...
Yin-Jing Tien, Yun-Shien Lee, Han-Ming Wu, Chun-Ho...
SPIRE
2004
Springer
14 years 1 months ago
Evaluating Relevance Feedback and Display Strategies for Searching on Small Displays
Abstract Searching information resources using mobile devices is affected by displays on which only a small fraction of the set of ranked documents can be displayed. In this study ...
Vishwa Vinay, Ingemar J. Cox, Natasa Milic-Fraylin...