3591 search results - page 263 / 719 » Typing linear constraints |
222
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper studies the problem of stability analysis for neural networks (NNs) with a time-varying delay. The activation functions are assumed to be neither monotonic, nor diff...
165
click to vote
AAECC
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and s...
211
click to vote
EUROGP
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved f...
165
click to vote
ICALP
2005
Springer
16 years 23 days ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
241
click to vote
ESWS
2011
Springer
14 years 10 months ago
2011
Springer
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...