71 search results - page 11 / 15 » An Evolving Algebra Abstract Machine |
ECAI
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
NEUROSCIENCE
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. Finite-state machines are the most pervasive models of computation, not only in theoretical computer science, but also in all of its applications to real-life problems, a...
ECML
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Many complex control problems are not amenable to traditional controller design. Not only is it difficult to model real systems, but often it is unclear what kind of beha...
APLAS
2004
ACM
14 years 4 months ago
2004
ACM
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas eļ¬ciently. The design choices however eļ...
IFM
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We describe how CSP-OZ, an integrated formal method combining the process algebra CSP with the speciļ¬cation language Object-Z, can be linked to standard software engine...