2853 search results - page 395 / 571 » On Coherence in Computer Algebra |
80
Voted
AAAI
1994
14 years 11 months ago
1994
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
AAAI
1990
14 years 11 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
AUTOMATICA
2008
14 years 10 months ago
2008
We consider the problem of computing the root-mean-square (RMS) gain of switched linear systems. We develop a new approach which is based on an attempt to characterize the "w...
95
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead emp...
73
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of nonorthomodular and thus non-distributive lattices that properly...