Sciweavers

315 search results - page 60 / 63
» Are Multiple Runs of Genetic Algorithms Better than One
Sort
View
ATAL
2008
Springer
14 years 23 days ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
FGR
2008
IEEE
180views Biometrics» more  FGR 2008»
14 years 5 months ago
Image-set matching using a geodesic distance and cohort normalization
An image-set based face recognition algorithm is proposed that exploits the full geometrical interpretation of Canonical Correlation Analysis (CCA). CCA maximizes the correlation ...
Yui Man Lui, J. Ross Beveridge, Bruce A. Draper, M...
BMCBI
2010
147views more  BMCBI 2010»
13 years 11 months ago
baySeq: Empirical Bayesian methods for identifying differential expression in sequence count data
Background: High throughput sequencing has become an important technology for studying expression levels in many types of genomic, and particularly transcriptomic, data. One key w...
Thomas J. Hardcastle, Krystyna A. Kelly
CAV
2010
Springer
282views Hardware» more  CAV 2010»
14 years 2 months ago
A NuSMV Extension for Graded-CTL Model Checking
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
Alessandro Ferrante, Maurizio Memoli, Margherita N...
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 3 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...