Sciweavers

1920 search results - page 267 / 384
» The Complexity of the A B C Problem
Sort
View
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
14 years 2 months ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene
BMCBI
2008
129views more  BMCBI 2008»
13 years 9 months ago
EMAAS: An extensible grid-based Rich Internet Application for microarray data analysis and management
Background: Microarray experimentation requires the application of complex analysis methods as well as the use of non-trivial computer technologies to manage the resultant large d...
Geraint Barton, J. C. Abbott, Norie Chiba, D. W. H...
ICEIS
2003
IEEE
14 years 2 months ago
Live-Representation Process Management
Abstract: We present the live-representation approach for managing and working in complex, dynamic business processes. In this approach, aspects of business-process modeling, proje...
Daniel D. Corkill, Zachary B. Rubinstein, Susan E....
IJCNN
2000
IEEE
14 years 1 months ago
EM Algorithms for Self-Organizing Maps
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
Tom Heskes, Jan-Joost Spanjers, Wim Wiegerinck
AAAI
2006
13 years 10 months ago
Learning Systems of Concepts with an Infinite Relational Model
Relationships between concepts account for a large proportion of semantic knowledge. We present a nonparametric Bayesian model that discovers systems of related concepts. Given da...
Charles Kemp, Joshua B. Tenenbaum, Thomas L. Griff...