Sciweavers

6943 search results - page 1279 / 1389
» Representations for evolutionary algorithms
Sort
View
132
Voted
CORR
1998
Springer
135views Education» more  CORR 1998»
15 years 4 months ago
The Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
ISB
2002
112views more  ISB 2002»
15 years 4 months ago
High quality visualization of biochemical pathways in BioPath
ABSTRACT: Biochemical reactions form large and complex networks. Comprehensible visual representations of these networks help biochemists understand the relationships between the c...
Falk Schreiber
JMLR
2002
138views more  JMLR 2002»
15 years 4 months ago
Learning Probabilistic Models of Link Structure
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...
Lise Getoor, Nir Friedman, Daphne Koller, Benjamin...
156
Voted
DM
1999
145views more  DM 1999»
15 years 4 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad
ML
2002
ACM
163views Machine Learning» more  ML 2002»
15 years 4 months ago
Structural Modelling with Sparse Kernels
A widely acknowledged drawback of many statistical modelling techniques, commonly used in machine learning, is that the resulting model is extremely difficult to interpret. A numb...
Steve R. Gunn, Jaz S. Kandola
« Prev « First page 1279 / 1389 Last » Next »