Sciweavers

14699 search results - page 2572 / 2940
» Complexity and Cognitive Computing
Sort
View
DAM
1999
128views more  DAM 1999»
15 years 7 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
MAM
2002
128views more  MAM 2002»
15 years 7 months ago
Component-based development of DSP software for mobile communication terminals
DSP software development has been tied down by extreme computational requirements. Furthermore, the DSP development tools available today are less advanced than in other embedded ...
Kari Jyrkkä, Olli Silvén, Olli Ali-Yrk...
ML
2002
ACM
143views Machine Learning» more  ML 2002»
15 years 7 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
NECO
2002
145views more  NECO 2002»
15 years 7 months ago
Bayesian Model Assessment and Comparison Using Cross-Validation Predictive Densities
In this work, we discuss practical methods for the assessment, comparison, and selection of complex hierarchical Bayesian models. A natural way to assess the goodness of the model...
Aki Vehtari, Jouko Lampinen
177
Voted
NN
2002
Springer
122views Neural Networks» more  NN 2002»
15 years 7 months ago
Cellular, synaptic and network effects of neuromodulation
All network dynamics emerge from the complex interaction between the intrinsic membrane properties of network neurons and their synaptic connections. Nervous systems contain numer...
Eve Marder, Vatsala Thirumalai
« Prev « First page 2572 / 2940 Last » Next »