1175 search results - page 81 / 235 » Abstract computability and algebraic specification |
KI
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. This paper discusses experiments with an agent oriented approach to automated and interactive reasoning. The approach combines ideas from two subfields of AI (theorem pr...
ISSAC
1992
Springer
13 years 11 months ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract: Non-linear state estimation and some related topics, like parametric estimation, fault diagnosis, and perturbation attenuation, are tackled here via a new methodology in ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
FPL
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This work discusses the Memory Architecture for Reconfigurable Computers (MARC), a scalable, device-independent memory interface that supports both irregular (via configu...