Sciweavers

10568 search results - page 1803 / 2114
» Computer Intelligence and Formalization
Sort
View
CP
2007
Springer
15 years 10 months ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
129
Voted
DRM
2007
Springer
15 years 10 months ago
Randomized radon transforms for biometric authentication via fingerprint hashing
We present a new technique for generating biometric fingerprint hashes, or summaries of information contained in human fingerprints. Our method calculates and aggregates various...
Mariusz H. Jakubowski, Ramarathnam Venkatesan
123
Voted
ECSQARU
2007
Springer
15 years 10 months ago
Syntactic Propositional Belief Bases Fusion with Removed Sets
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...
Julien Hué, Odile Papini, Eric Würbel
ESAW
2007
Springer
15 years 10 months ago
Arguing about Reputation: The LRep Language
In the field of multiagent systems (MAS), the computational models of trust and reputation have attracted increasing interest since electronic and open environments became a reali...
Isaac Pinyol, Jordi Sabater-Mir
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 10 months ago
A multi-objective approach to discover biclusters in microarray data
The main motivation for using a multi–objective evolutionary algorithm for finding biclusters in gene expression data is motivated by the fact that when looking for biclusters ...
Federico Divina, Jesús S. Aguilar-Ruiz
« Prev « First page 1803 / 2114 Last » Next »