Sciweavers

5316 search results - page 989 / 1064
» Which Search Problems Are Random
Sort
View
ITSL
2008
15 years 2 months ago
An Empirical Comparison of NML Clustering Algorithms
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...
Petri Kontkanen, Petri Myllymäki
AAAI
2006
15 years 2 months ago
Multimodal Cognitive Architecture: Making Perception More Central to Intelligent Behavior
I propose that the notion of cognitive state be broadened from the current predicate-symbolic, Language-of-Thought framework to a multi-modal one, where perception and kinesthetic...
B. Chandrasekaran
BMCBI
2006
95views more  BMCBI 2006»
15 years 1 months ago
Discrete profile comparison using information bottleneck
Sequence homologs are an important source of information about proteins. Amino acid profiles, representing the position-specific mutation probabilities found in profiles, are a ri...
Sean O'Rourke, Gal Chechik, Robin Friedman, Eleaza...
CPHYSICS
2006
127views more  CPHYSICS 2006»
15 years 1 months ago
GenAnneal: Genetically modified Simulated Annealing
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
Ioannis G. Tsoulos, Isaac E. Lagaris
EAAI
2006
189views more  EAAI 2006»
15 years 1 months ago
Evolutionary algorithms for VLSI multi-objective netlist partitioning
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
Sadiq M. Sait, Aiman H. El-Maleh, Raslan H. Al-Aba...