1589 search results - page 145 / 318 » Constraints with Variables' Annotations |
ICANN
2007
Springer
14 years 3 months ago
2007
Springer
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
ISLPED
2006
ACM
14 years 2 months ago
2006
ACM
Sub-threshold operation is a compelling approach for energyconstrained applications, but increased sensitivity to variation must be mitigated. We explore variability metrics and t...
CSCLP
2005
Springer
14 years 2 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
IDA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We investigate an application of Probabilistic Latent Semantics to the problem of device usage analysis in an infrastructure in which multiple users have access to a shar...
ATAL
2006
Springer
14 years 21 days ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...