Sciweavers

1143 search results - page 144 / 229
» Mental models of recursion
Sort
View
RAS
2010
117views more  RAS 2010»
13 years 7 months ago
Extending BDI plan selection to incorporate learning from experience
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. We describe a novel BDI exe...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...
CDC
2010
IEEE
196views Control Systems» more  CDC 2010»
13 years 4 months ago
Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema
The asymptotic behavior of stochastic gradient algorithms is studied. Relying on some results of differential geometry (Lojasiewicz gradient inequality), the almost sure pointconve...
Vladislav B. Tadic
BMCBI
2006
142views more  BMCBI 2006»
13 years 9 months ago
Improving the Performance of SVM-RFE to Select Genes in Microarray Data
Background: Recursive Feature Elimination is a common and well-studied method for reducing the number of attributes used for further analysis or development of prediction models. ...
Yuanyuan Ding, Dawn Wilkins
MST
2000
86views more  MST 2000»
13 years 8 months ago
Team Learning of Computable Languages
A team of learning machines is a multiset of learning machines. A team is said to successfully learn a concept just in case each member of some nonempty subset, of predetermined s...
Sanjay Jain, Arun Sharma
DAC
1999
ACM
14 years 10 months ago
Equivalent Elmore Delay for RLC Trees
- Closed form solutions for the 50% delay, rise time, overshoots, and settling time of signals in an RLC tree are presented. These solutions have the same accuracy characteristics ...
Eby G. Friedman, José Luis Neves, Yehea I. ...